./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0720_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_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 8e02dcef35ad2f5a687bc8bb1bb905c7949799d0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 8e02dcef35ad2f5a687bc8bb1bb905c7949799d0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:35:12,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:35:12,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:35:12,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:35:12,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:35:12,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:35:12,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:35:12,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:35:12,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:35:12,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:35:12,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:35:12,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:35:12,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:35:12,768 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:35:12,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:35:12,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:35:12,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:35:12,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:35:12,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:35:12,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:35:12,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:35:12,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:35:12,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:35:12,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:35:12,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:35:12,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:35:12,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:35:12,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:35:12,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:35:12,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:35:12,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:35:12,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:35:12,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:35:12,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:35:12,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:35:12,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:35:12,783 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:35:12,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:35:12,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:35:12,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:35:12,794 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:35:12,794 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:35:12,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:35:12,794 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:35:12,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:35:12,794 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:35:12,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:35:12,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:35:12,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:35:12,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:35:12,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:35:12,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:35:12,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:35:12,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:35:12,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:35:12,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:35:12,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:35:12,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:35:12,799 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_530dff93-e343-4de5-90a0-f90d155fa0a1/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 -> 8e02dcef35ad2f5a687bc8bb1bb905c7949799d0 [2018-11-23 05:35:12,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:35:12,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:35:12,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:35:12,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:35:12,835 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:35:12,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:12,879 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/c4fbe30b9/319c4b40e47c44f2888480d6f3bc94e7/FLAGa13046945 [2018-11-23 05:35:13,290 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:35:13,291 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:13,296 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/c4fbe30b9/319c4b40e47c44f2888480d6f3bc94e7/FLAGa13046945 [2018-11-23 05:35:13,305 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/c4fbe30b9/319c4b40e47c44f2888480d6f3bc94e7 [2018-11-23 05:35:13,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:35:13,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:35:13,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:35:13,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:35:13,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:35:13,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a16ae76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13, skipping insertion in model container [2018-11-23 05:35:13,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:35:13,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:35:13,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:35:13,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:35:13,477 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:35:13,489 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:35:13,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13 WrapperNode [2018-11-23 05:35:13,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:35:13,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:35:13,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:35:13,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:35:13,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:35:13,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:35:13,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:35:13,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:35:13,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... [2018-11-23 05:35:13,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:35:13,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:35:13,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:35:13,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:35:13,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:35:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 05:35:13,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 05:35:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:35:13,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:35:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 05:35:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:35:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-11-23 05:35:13,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-11-23 05:35:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:35:13,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:35:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 05:35:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:35:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:35:13,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:35:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:35:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:35:13,944 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:35:13,944 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 05:35:13,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:13 BoogieIcfgContainer [2018-11-23 05:35:13,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:35:13,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:35:13,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:35:13,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:35:13,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:35:13" (1/3) ... [2018-11-23 05:35:13,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19039a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:35:13, skipping insertion in model container [2018-11-23 05:35:13,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:13" (2/3) ... [2018-11-23 05:35:13,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19039a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:35:13, skipping insertion in model container [2018-11-23 05:35:13,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:13" (3/3) ... [2018-11-23 05:35:13,950 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:13,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:35:13,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:35:13,973 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:35:13,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:35:13,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:35:13,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:35:13,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:35:13,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:35:13,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:35:13,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:35:13,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:35:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-11-23 05:35:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:35:14,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:35:14,013 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 05:35:14,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:35:14,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:35:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash -429811670, now seen corresponding path program 1 times [2018-11-23 05:35:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:35:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:35:14,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:35:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:35:14,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:35:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:35:14,104 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 05:35:14,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:35:14,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:35:14,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:35:14,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:35:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:35:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:35:14,121 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-11-23 05:35:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:35:14,135 INFO L93 Difference]: Finished difference Result 116 states and 172 transitions. [2018-11-23 05:35:14,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:35:14,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 05:35:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:35:14,142 INFO L225 Difference]: With dead ends: 116 [2018-11-23 05:35:14,142 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 05:35:14,144 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 05:35:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 05:35:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 05:35:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 05:35:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2018-11-23 05:35:14,168 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 20 [2018-11-23 05:35:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:35:14,169 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-11-23 05:35:14,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:35:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2018-11-23 05:35:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:35:14,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:35:14,170 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] [2018-11-23 05:35:14,170 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:35:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:35:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1876471549, now seen corresponding path program 1 times [2018-11-23 05:35:14,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:35:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:35:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:35:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:35:14,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:35:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:35:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:35:14,228 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9, |old(~one_sqrt~0)|=16.0, |old(~tiny_sqrt~0)|=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-300; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9, |old(~one_sqrt~0)|=16.0, |old(~tiny_sqrt~0)|=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9, |old(~one_sqrt~0)|=16.0, |old(~tiny_sqrt~0)|=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] RET #198#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] ~x := #in~x;havoc ~z~0;~sign~0 := -2147483648;havoc ~r~0;havoc ~t1~0;havoc ~s1~0;havoc ~ix1~0;havoc ~q1~0;havoc ~ix0~0;havoc ~s0~0;havoc ~q~0;havoc ~m~0;havoc ~t~0;havoc ~i~0; VAL [__ieee754_sqrt_~sign~0=(- 2147483648), __ieee754_sqrt_~x=17.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~ix1~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__ieee754_sqrt_~ix0~0=3, __ieee754_sqrt_~ix1~0=13, __ieee754_sqrt_~sign~0=(- 2147483648), __ieee754_sqrt_~x=17.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_sqrt_~ix0~0=3, __ieee754_sqrt_~ix1~0=13, __ieee754_sqrt_~sign~0=(- 2147483648), __ieee754_sqrt_~x=17.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072);#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [__ieee754_sqrt_~ix0~0=3, __ieee754_sqrt_~ix1~0=13, __ieee754_sqrt_~sign~0=(- 2147483648), __ieee754_sqrt_~x=17.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume true; VAL [__ieee754_sqrt_~ix0~0=3, __ieee754_sqrt_~ix1~0=13, __ieee754_sqrt_~sign~0=(- 2147483648), __ieee754_sqrt_~x=17.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_sqrt_#in~x|=17.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] RET #202#return; VAL [main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] ~res~0 := #t~ret7;havoc #t~ret7; VAL [main_~res~0=15.0, main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] CALL call #t~ret8 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=15.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0, |isnan_double_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume true; VAL [isnan_double_~x=15.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0, |isnan_double_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] RET #204#return; VAL [main_~res~0=15.0, main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~res~0=15.0, main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~res~0=15.0, main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !false; VAL [main_~res~0=15.0, main_~x~0=17.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L30] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L32] ~ix1~0 := #t~mem2; [L32] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L29] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35-L37] assume 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072); [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L22-L130] ensures true; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L18] ensures true; VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144-L147] assume 0 == #t~ret8; [L144] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L30] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L32] ~ix1~0 := #t~mem2; [L32] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L29] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35-L37] assume 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072); [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L22-L130] ensures true; VAL [#in~x=17.0, #NULL.base=0, #NULL.offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L18] ensures true; VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144-L147] assume 0 == #t~ret8; [L144] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L30] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L32] ~ix1~0 := #t~mem2; [L32] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L29] havoc ~#ew_u~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] COND TRUE 0 == #t~ret8 [L144] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L30] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L32] ~ix1~0 := #t~mem2; [L32] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L29] havoc ~#ew_u~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] COND TRUE 0 == #t~ret8 [L144] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L30] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L32] ~ix1~0 := #t~mem2; [L32] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L29] havoc ~#ew_u~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] COND TRUE 0 == #t~ret8 [L144] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=16.0, ~tiny_sqrt~0=10.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] ~one_sqrt~0 := 1.0; [L20] ~tiny_sqrt~0 := 1.0E-300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9, old(~one_sqrt~0)=16.0, old(~tiny_sqrt~0)=10.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L22-L130] ~x := #in~x; [L23] havoc ~z~0; [L24] ~sign~0 := -2147483648; [L25] havoc ~r~0; [L25] havoc ~t1~0; [L25] havoc ~s1~0; [L25] havoc ~ix1~0; [L25] havoc ~q1~0; [L26] havoc ~ix0~0; [L26] havoc ~s0~0; [L26] havoc ~q~0; [L26] havoc ~m~0; [L26] havoc ~t~0; [L26] havoc ~i~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L29] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L30] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L31] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L31] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union1; [L31] havoc #t~mem0; [L32] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L32] ~ix1~0 := #t~mem2; [L32] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem2; [L32] havoc #t~union3; [L29] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L29] havoc ~#ew_u~0; VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L35] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L36] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#in~x=17.0, #NULL!base=0, #NULL!offset=0, ~ix0~0=3, ~ix1~0=13, ~one_sqrt~0=1.0, ~sign~0=-2147483648, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=17.0] [L141] RET call #t~ret7 := __ieee754_sqrt(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=15.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L141] ~res~0 := #t~ret7; [L141] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] ~x := #in~x; [L18] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x=15.0] [L144] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L144] COND TRUE 0 == #t~ret8 [L144] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L145] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=15.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, ~x~0=17.0] [L20] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [\old(one_sqrt)=16, \old(tiny_sqrt)=10, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] double x = 0.0 / 0.0; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL, EXPR __ieee754_sqrt(x) VAL [\old(x)=17, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] double z; [L24] __int32_t sign = 0x80000000; [L25] __uint32_t r, t1, s1, ix1, q1; [L26] __int32_t ix0, s0, q, m, t, i; VAL [\old(x)=17, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (ix0) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (ix1) = ew_u.parts.lsw [L35] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L36] return x * x + x; VAL [\old(x)=17, ix0=3, ix1=13, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L141] RET, EXPR __ieee754_sqrt(x) VAL [__ieee754_sqrt(x)=15, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L141] double res = __ieee754_sqrt(x); [L144] CALL, EXPR isnan_double(res) VAL [\old(x)=15, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] return x != x; VAL [\old(x)=15, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=15] [L144] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, one_sqrt=1, res=15, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L144] COND TRUE !isnan_double(res) [L145] __VERIFIER_error() VAL [one_sqrt=1, res=15, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] ----- [2018-11-23 05:35:14,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:35:14 BoogieIcfgContainer [2018-11-23 05:35:14,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:35:14,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:35:14,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:35:14,271 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:35:14,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:13" (3/4) ... [2018-11-23 05:35:14,274 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:35:14,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:35:14,275 INFO L168 Benchmark]: Toolchain (without parser) took 966.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -110.0 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:35:14,276 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:35:14,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:35:14,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:35:14,278 INFO L168 Benchmark]: Boogie Preprocessor took 33.52 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 05:35:14,278 INFO L168 Benchmark]: RCFGBuilder took 365.14 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:35:14,278 INFO L168 Benchmark]: TraceAbstraction took 325.45 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:35:14,279 INFO L168 Benchmark]: Witness Printer took 3.35 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 05:35:14,281 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 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 55.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 365.14 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 325.45 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 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: 145]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L20] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [\old(one_sqrt)=16, \old(tiny_sqrt)=10, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L139] double x = 0.0 / 0.0; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] CALL, EXPR __ieee754_sqrt(x) VAL [\old(x)=17, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] double z; [L24] __int32_t sign = 0x80000000; [L25] __uint32_t r, t1, s1, ix1, q1; [L26] __int32_t ix0, s0, q, m, t, i; VAL [\old(x)=17, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (ix0) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (ix1) = ew_u.parts.lsw [L35] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L36] return x * x + x; VAL [\old(x)=17, ix0=3, ix1=13, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L141] RET, EXPR __ieee754_sqrt(x) VAL [__ieee754_sqrt(x)=15, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L141] double res = __ieee754_sqrt(x); [L144] CALL, EXPR isnan_double(res) VAL [\old(x)=15, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L18] return x != x; VAL [\old(x)=15, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=15] [L144] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, one_sqrt=1, res=15, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] [L144] COND TRUE !isnan_double(res) [L145] __VERIFIER_error() VAL [one_sqrt=1, res=15, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=17] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 62 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 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=62occurred 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, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 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 05:35:15,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:35:15,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:35:15,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:35:15,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:35:15,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:35:15,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:35:15,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:35:15,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:35:15,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:35:15,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:35:15,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:35:15,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:35:15,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:35:15,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:35:15,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:35:15,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:35:15,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:35:15,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:35:15,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:35:15,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:35:15,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:35:15,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:35:15,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:35:15,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:35:15,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:35:15,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:35:15,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:35:15,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:35:15,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:35:15,740 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:35:15,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:35:15,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:35:15,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:35:15,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:35:15,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:35:15,742 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 05:35:15,752 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:35:15,752 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:35:15,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:35:15,753 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:35:15,753 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:35:15,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:35:15,754 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:35:15,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:35:15,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:35:15,754 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:35:15,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:35:15,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:35:15,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:35:15,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:35:15,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:35:15,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:35:15,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:35:15,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:35:15,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:35:15,757 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:35:15,757 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:35:15,757 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:35:15,757 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:35:15,757 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:35:15,757 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_530dff93-e343-4de5-90a0-f90d155fa0a1/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 -> 8e02dcef35ad2f5a687bc8bb1bb905c7949799d0 [2018-11-23 05:35:15,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:35:15,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:35:15,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:35:15,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:35:15,800 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:35:15,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:15,836 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/d4bd31ca9/d8b226a78aeb442a98743fafcdd1e047/FLAGf459a4d4c [2018-11-23 05:35:16,230 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:35:16,230 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/sv-benchmarks/c/float-newlib/double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:16,234 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/d4bd31ca9/d8b226a78aeb442a98743fafcdd1e047/FLAGf459a4d4c [2018-11-23 05:35:16,242 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/data/d4bd31ca9/d8b226a78aeb442a98743fafcdd1e047 [2018-11-23 05:35:16,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:35:16,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:35:16,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:35:16,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:35:16,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:35:16,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5cec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16, skipping insertion in model container [2018-11-23 05:35:16,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:35:16,278 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:35:16,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:35:16,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:35:16,459 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:35:16,475 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:35:16,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16 WrapperNode [2018-11-23 05:35:16,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:35:16,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:35:16,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:35:16,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:35:16,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:35:16,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:35:16,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:35:16,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:35:16,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... [2018-11-23 05:35:16,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:35:16,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:35:16,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:35:16,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:35:16,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:35:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 05:35:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 05:35:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 05:35:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 05:35:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:35:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:35:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-11-23 05:35:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:35:16,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:35:16,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 05:35:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:35:17,019 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 05:35:19,728 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:35:19,729 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 05:35:19,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:19 BoogieIcfgContainer [2018-11-23 05:35:19,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:35:19,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:35:19,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:35:19,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:35:19,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:35:16" (1/3) ... [2018-11-23 05:35:19,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a573bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:35:19, skipping insertion in model container [2018-11-23 05:35:19,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:35:16" (2/3) ... [2018-11-23 05:35:19,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a573bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:35:19, skipping insertion in model container [2018-11-23 05:35:19,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:19" (3/3) ... [2018-11-23 05:35:19,736 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0720_true-unreach-call.c [2018-11-23 05:35:19,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:35:19,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:35:19,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:35:19,784 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:35:19,785 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:35:19,785 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:35:19,785 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:35:19,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:35:19,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:35:19,785 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:35:19,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:35:19,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:35:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-23 05:35:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:35:19,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:35:19,799 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 05:35:19,801 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:35:19,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:35:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash 295214612, now seen corresponding path program 1 times [2018-11-23 05:35:19,806 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:35:19,806 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:35:19,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:35:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:35:20,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:35:20,130 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 05:35:20,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:35:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:35:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:35:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:35:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:35:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:35:20,153 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-23 05:35:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:35:20,173 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2018-11-23 05:35:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:35:20,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 05:35:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:35:20,183 INFO L225 Difference]: With dead ends: 114 [2018-11-23 05:35:20,184 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 05:35:20,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:35:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 05:35:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 05:35:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:35:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-11-23 05:35:20,219 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 19 [2018-11-23 05:35:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:35:20,219 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2018-11-23 05:35:20,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:35:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2018-11-23 05:35:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:35:20,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:35:20,220 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 05:35:20,221 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:35:20,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:35:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash 438908261, now seen corresponding path program 1 times [2018-11-23 05:35:20,222 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:35:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:35:20,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:35:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:35:20,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:35:28,225 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 05:35:32,148 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 05:35:32,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:35:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:35:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:35:32,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:35:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:35:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:35:32,161 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 9 states. [2018-11-23 05:35:45,595 WARN L180 SmtUtils]: Spent 4.54 s on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 05:36:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:36:04,570 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2018-11-23 05:36:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:36:04,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 05:36:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:36:04,572 INFO L225 Difference]: With dead ends: 64 [2018-11-23 05:36:04,572 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 05:36:04,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 [2018-11-23 05:36:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 05:36:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 05:36:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:36:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-23 05:36:04,582 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 20 [2018-11-23 05:36:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:36:04,582 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-23 05:36:04,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:36:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2018-11-23 05:36:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:36:04,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:36:04,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:36:04,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:36:04,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:36:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1464284033, now seen corresponding path program 1 times [2018-11-23 05:36:04,585 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:36:04,586 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:36:04,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:36:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:36:04,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:36:04,770 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 05:36:04,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:36:04,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:36:04,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:36:04,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:36:04,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:36:04,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:36:04,778 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand 9 states. [2018-11-23 05:36:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:36:06,965 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2018-11-23 05:36:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:36:06,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 05:36:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:36:06,967 INFO L225 Difference]: With dead ends: 64 [2018-11-23 05:36:06,967 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 05:36:06,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:36:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 05:36:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 05:36:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:36:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-11-23 05:36:06,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 22 [2018-11-23 05:36:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:36:06,973 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-11-23 05:36:06,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:36:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-23 05:36:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:36:06,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:36:06,974 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 05:36:06,974 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:36:06,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:36:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash -428456562, now seen corresponding path program 1 times [2018-11-23 05:36:06,974 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:36:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:36:06,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:36:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:36:07,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:36:19,725 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 05:36:33,819 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 05:36:33,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:36:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:36:33,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:36:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:36:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:36:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-11-23 05:36:33,834 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 9 states. [2018-11-23 05:36:54,110 WARN L180 SmtUtils]: Spent 8.57 s on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 05:37:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:37:03,676 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-23 05:37:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:37:03,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 05:37:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:37:03,677 INFO L225 Difference]: With dead ends: 64 [2018-11-23 05:37:03,677 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 05:37:03,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2018-11-23 05:37:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 05:37:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 05:37:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:37:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2018-11-23 05:37:03,682 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 23 [2018-11-23 05:37:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:37:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-11-23 05:37:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:37:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2018-11-23 05:37:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 05:37:03,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:37:03,683 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, 1, 1, 1] [2018-11-23 05:37:03,684 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:37:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:37:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1375058646, now seen corresponding path program 1 times [2018-11-23 05:37:03,684 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:37:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:37:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:37:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:37:03,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:03,770 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 05:37:03,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:37:03,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:37:03,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:37:03,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:37:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:37:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:37:03,783 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand 3 states. [2018-11-23 05:37:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:37:03,817 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 05:37:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:37:03,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 05:37:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:37:03,819 INFO L225 Difference]: With dead ends: 90 [2018-11-23 05:37:03,819 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 05:37:03,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:37:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 05:37:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 05:37:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 05:37:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2018-11-23 05:37:03,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 36 [2018-11-23 05:37:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:37:03,825 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2018-11-23 05:37:03,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:37:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2018-11-23 05:37:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:37:03,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:37:03,827 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, 1, 1, 1, 1, 1, 1] [2018-11-23 05:37:03,827 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:37:03,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:37:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1988515579, now seen corresponding path program 1 times [2018-11-23 05:37:03,827 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:37:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:37:03,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:37:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:37:03,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:37:03,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:37:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:37:03,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:37:03,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:37:03,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:37:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:37:03,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:37:03,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:37:04,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:37:04,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-23 05:37:04,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:37:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:37:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:37:04,006 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand 8 states. [2018-11-23 05:37:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:37:04,186 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2018-11-23 05:37:04,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:37:04,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-23 05:37:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:37:04,187 INFO L225 Difference]: With dead ends: 112 [2018-11-23 05:37:04,187 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 05:37:04,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:37:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 05:37:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 05:37:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 05:37:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2018-11-23 05:37:04,193 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 39 [2018-11-23 05:37:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:37:04,193 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2018-11-23 05:37:04,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:37:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2018-11-23 05:37:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 05:37:04,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:37:04,194 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1] [2018-11-23 05:37:04,194 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:37:04,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:37:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -219636531, now seen corresponding path program 1 times [2018-11-23 05:37:04,195 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:37:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/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 05:37:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:37:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:37:04,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:37:04,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:37:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:37:04,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:37:04,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:37:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:37:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:37:04,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:37:04,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:37:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:37:04,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:37:04,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 12 [2018-11-23 05:37:04,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:37:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:37:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:37:04,446 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand 12 states. [2018-11-23 05:37:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:37:04,610 INFO L93 Difference]: Finished difference Result 145 states and 197 transitions. [2018-11-23 05:37:04,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:37:04,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 05:37:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:37:04,611 INFO L225 Difference]: With dead ends: 145 [2018-11-23 05:37:04,611 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 05:37:04,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:37:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 05:37:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 05:37:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 05:37:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2018-11-23 05:37:04,625 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 57 [2018-11-23 05:37:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:37:04,625 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2018-11-23 05:37:04,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:37:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2018-11-23 05:37:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 05:37:04,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:37:04,627 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 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, 1, 1, 1] [2018-11-23 05:37:04,627 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:37:04,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:37:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1079318125, now seen corresponding path program 2 times [2018-11-23 05:37:04,629 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:37:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 05:37:04,634 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:37:04,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 05:37:04,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:37:04,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:37:04,738 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:37:04,739 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:37:04,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 05:37:04,773 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:37:04,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 05:37:04,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:37:04,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 05:37:04,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 05:37:04,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:37:04,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:37:04,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:37:04,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:37:04,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 05:37:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-23 05:37:04,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:37:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:37:04,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:37:04,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:37:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:37:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:37:04,914 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 6 states. [2018-11-23 05:37:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:37:05,485 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2018-11-23 05:37:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:37:05,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-23 05:37:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:37:05,486 INFO L225 Difference]: With dead ends: 105 [2018-11-23 05:37:05,487 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:37:05,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:37:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:37:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:37:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:37:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:37:05,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-11-23 05:37:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:37:05,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:37:05,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:37:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:37:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:37:05,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:37:05,656 INFO L451 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 22 130) the Hoare annotation is: true [2018-11-23 05:37:05,656 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 94) no Hoare annotation was computed. [2018-11-23 05:37:05,656 INFO L448 ceAbstractionStarter]: For program point L93-2(lines 93 94) no Hoare annotation was computed. [2018-11-23 05:37:05,656 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 22 130) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 101) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |__ieee754_sqrt_#in~x|) (not (= (_ bv2146435072 32) (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)))))) (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 22 130) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 64) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 61 64) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L444 ceAbstractionStarter]: At program point L28-2(lines 28 33) the Hoare annotation is: (and (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L28-3(lines 22 130) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L53-2(lines 53 54) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L444 ceAbstractionStarter]: At program point L53-3(lines 53 54) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |__ieee754_sqrt_#in~x|) (not (= (_ bv2146435072 32) (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)))))) (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L53-4(lines 53 54) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 112) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L111-2(lines 111 112) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 117) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 121) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 121) no Hoare annotation was computed. [2018-11-23 05:37:05,657 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 97) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 97) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L47-2(lines 47 58) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 116) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 44) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L444 ceAbstractionStarter]: At program point L72-2(lines 72 82) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |__ieee754_sqrt_#in~x|) (not (= (_ bv2146435072 32) (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)))))) (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L39-2(lines 39 44) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L72-3(lines 72 82) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L444 ceAbstractionStarter]: At program point L48-2(lines 48 52) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |__ieee754_sqrt_#in~x|) (not (= (_ bv2146435072 32) (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)))))) (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L48-3(lines 48 52) no Hoare annotation was computed. [2018-11-23 05:37:05,658 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 43) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 22 130) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 123 128) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 128) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |__ieee754_sqrt_#in~x|) (not (= (_ bv2146435072 32) (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)))))) (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L90-2(lines 90 91) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L123-3(lines 123 128) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 115) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2018-11-23 05:37:05,659 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 18) the Hoare annotation is: true [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 18) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 18) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:37:05,660 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L444 ceAbstractionStarter]: At program point L144(line 144) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~res~0 .cse0))) [2018-11-23 05:37:05,660 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 144 147) no Hoare annotation was computed. [2018-11-23 05:37:05,660 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 132 150) the Hoare annotation is: true [2018-11-23 05:37:05,660 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) [2018-11-23 05:37:05,661 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 132 150) no Hoare annotation was computed. [2018-11-23 05:37:05,661 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-23 05:37:05,661 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 132 150) no Hoare annotation was computed. [2018-11-23 05:37:05,661 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-11-23 05:37:05,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:37:05 BoogieIcfgContainer [2018-11-23 05:37:05,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:37:05,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:37:05,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:37:05,678 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:37:05,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:35:19" (3/4) ... [2018-11-23 05:37:05,682 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:37:05,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-11-23 05:37:05,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 05:37:05,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:37:05,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:37:05,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 05:37:05,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 05:37:05,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 05:37:05,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,712 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,712 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,712 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-11-23 05:37:05,735 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_530dff93-e343-4de5-90a0-f90d155fa0a1/bin-2019/utaipan/witness.graphml [2018-11-23 05:37:05,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:37:05,736 INFO L168 Benchmark]: Toolchain (without parser) took 109491.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:37:05,736 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 05:37:05,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.94 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 05:37:05,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.46 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 05:37:05,737 INFO L168 Benchmark]: Boogie Preprocessor took 67.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:37:05,737 INFO L168 Benchmark]: RCFGBuilder took 3167.65 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:37:05,737 INFO L168 Benchmark]: TraceAbstraction took 105947.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:37:05,738 INFO L168 Benchmark]: Witness Printer took 57.05 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 05:37:05,739 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 230.94 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 17.46 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 67.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3167.65 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105947.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * Witness Printer took 57.05 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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: 28]: Loop Invariant Derived loop invariant: x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 72]: Loop Invariant [2018-11-23 05:37:05,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 53]: Loop Invariant [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 123]: Loop Invariant [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 48]: Loop Invariant [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 85]: Loop Invariant [2018-11-23 05:37:05,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 05:37:05,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !(2146435072bv32 == ~bvand32(2146435072bv32, v_prenex_5[63:32]))) && x == \old(x)) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 61 locations, 1 error locations. SAFE Result, 105.8s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 65.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 540 SDtfs, 448 SDslu, 1797 SDs, 0 SdLazy, 419 SolverSat, 37 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 70.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 21 PreInvPairs, 45 NumberOfFragments, 169 HoareAnnotationTreeSize, 21 FomulaSimplifications, 523 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 38.4s InterpolantComputationTime, 387 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 527 ConstructedInterpolants, 59 QuantifiedInterpolants, 124605 SizeOfPredicates, 21 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 206/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...