./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_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_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:59:57,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:59:57,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:59:57,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:59:57,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:59:57,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:59:57,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:59:57,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:59:57,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:59:57,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:59:57,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:59:57,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:59:57,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:59:57,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:59:57,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:59:57,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:59:57,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:59:57,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:59:57,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:59:57,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:59:57,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:59:57,283 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:59:57,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:59:57,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:59:57,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:59:57,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:59:57,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:59:57,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:59:57,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:59:57,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:59:57,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:59:57,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:59:57,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:59:57,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:59:57,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:59:57,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:59:57,289 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:59:57,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:59:57,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:59:57,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:59:57,300 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:59:57,300 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:59:57,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:59:57,300 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:59:57,300 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:59:57,301 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:59:57,301 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:59:57,301 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:59:57,301 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:59:57,301 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:59:57,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:59:57,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:59:57,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:59:57,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:59:57,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:59:57,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:59:57,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:59:57,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:59:57,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:59:57,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:59:57,304 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_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-11-22 23:59:57,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:59:57,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:59:57,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:59:57,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:59:57,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:59:57,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-22 23:59:57,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/7f6a2b1de/f25ea2df42d147cba6e65376c9ae714d/FLAG8f386f7ab [2018-11-22 23:59:57,801 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:59:57,801 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-22 23:59:57,806 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/7f6a2b1de/f25ea2df42d147cba6e65376c9ae714d/FLAG8f386f7ab [2018-11-22 23:59:57,816 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/7f6a2b1de/f25ea2df42d147cba6e65376c9ae714d [2018-11-22 23:59:57,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:59:57,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:59:57,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:59:57,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:59:57,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:59:57,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:59:57" (1/1) ... [2018-11-22 23:59:57,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fb40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:57, skipping insertion in model container [2018-11-22 23:59:57,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:59:57" (1/1) ... [2018-11-22 23:59:57,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:59:57,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:59:57,985 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:59:57,991 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:59:58,019 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:59:58,070 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:59:58,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58 WrapperNode [2018-11-22 23:59:58,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:59:58,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:59:58,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:59:58,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:59:58,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:59:58,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:59:58,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:59:58,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:59:58,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... [2018-11-22 23:59:58,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:59:58,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:59:58,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:59:58,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:59:58,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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-22 23:59:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-22 23:59:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-22 23:59:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-22 23:59:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-22 23:59:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:59:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:59:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:59:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:59:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:59:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-22 23:59:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:59:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-22 23:59:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-22 23:59:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:59:58,541 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:59:58,541 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-22 23:59:58,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:59:58 BoogieIcfgContainer [2018-11-22 23:59:58,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:59:58,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:59:58,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:59:58,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:59:58,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:59:57" (1/3) ... [2018-11-22 23:59:58,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b4199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:59:58, skipping insertion in model container [2018-11-22 23:59:58,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:59:58" (2/3) ... [2018-11-22 23:59:58,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b4199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:59:58, skipping insertion in model container [2018-11-22 23:59:58,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:59:58" (3/3) ... [2018-11-22 23:59:58,548 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-11-22 23:59:58,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:59:58,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:59:58,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:59:58,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:59:58,598 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:59:58,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:59:58,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:59:58,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:59:58,599 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:59:58,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:59:58,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:59:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-22 23:59:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:59:58,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:59:58,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:59:58,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:59:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:59:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1736210886, now seen corresponding path program 1 times [2018-11-22 23:59:58,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:59:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:59:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:59:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:59:58,737 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-22 23:59:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:59:58,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:59:58,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:59:58,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 23:59:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:59:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:59:58,756 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-22 23:59:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:59:58,775 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-22 23:59:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:59:58,776 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-22 23:59:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:59:58,782 INFO L225 Difference]: With dead ends: 130 [2018-11-22 23:59:58,782 INFO L226 Difference]: Without dead ends: 65 [2018-11-22 23:59:58,784 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-22 23:59:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-22 23:59:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-22 23:59:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-22 23:59:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-22 23:59:58,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-22 23:59:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:59:58,811 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-22 23:59:58,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 23:59:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-22 23:59:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 23:59:58,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:59:58,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:59:58,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:59:58,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:59:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 884713430, now seen corresponding path program 1 times [2018-11-22 23:59:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:59:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:59:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:59:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:59:58,879 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-22 23:59:58,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:59:58,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:59:58,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:59:58,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:59:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:59:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:59:58,881 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 3 states. [2018-11-22 23:59:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:59:58,897 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-22 23:59:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:59:58,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 23:59:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:59:58,898 INFO L225 Difference]: With dead ends: 68 [2018-11-22 23:59:58,899 INFO L226 Difference]: Without dead ends: 65 [2018-11-22 23:59:58,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 23:59:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-22 23:59:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-22 23:59:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-22 23:59:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-22 23:59:58,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 30 [2018-11-22 23:59:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:59:58,906 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-22 23:59:58,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:59:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-22 23:59:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 23:59:58,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:59:58,907 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] [2018-11-22 23:59:58,907 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:59:58,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:59:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash -204320499, now seen corresponding path program 1 times [2018-11-22 23:59:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:59:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:59:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:59:58,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:59:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:59:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:59:59,022 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450954, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=6442450951.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_modf~0 := 1.0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=1.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=1.0] [?] RET #215#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8);call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8);havoc #t~nondet27; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; VAL [modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.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);~i0~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);~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] goto; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 20; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 0; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4);call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4);call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8);call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8);havoc #t~mem4;call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset);havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] goto; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] #res := ~x; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, |modf_double_#res|=6442450962.0, ~one_modf~0=1.0] [?] assume true; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, |modf_double_#res|=6442450962.0, ~one_modf~0=1.0] [?] RET #209#return; VAL [main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret28|=6442450962.0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] ~res~0 := #t~ret28;havoc #t~ret28;call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union22;havoc #t~mem21;call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union24;havoc #t~mem23;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=2147483647, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] goto; VAL [isinf_double_~hx~0=2147483647, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, |isinf_double_#res|=2, ~one_modf~0=1.0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, |isinf_double_#res|=2, ~one_modf~0=1.0] [?] RET #211#return; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#t~short33 := 0 != #t~ret30; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short33;#t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !#t~short32; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] #t~short33 := !#t~short32; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short33;havoc #t~ret30;havoc #t~mem29;havoc #t~short32;havoc #t~short33;havoc #t~ret31; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !false; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450946, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8); [L145] havoc #t~nondet27; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L24] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30-L107] assume ~j0~0 < 20; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31-L65] assume ~j0~0 < 0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); [L35] call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); [L36] call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); [L33] havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L20-L108] ensures true; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret28=6.442450962E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L114] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L111-L123] ensures true; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume #t~short33; [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149-L152] assume #t~short33; [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450946, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8); [L145] havoc #t~nondet27; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L24] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30-L107] assume ~j0~0 < 20; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31-L65] assume ~j0~0 < 0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); [L35] call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); [L36] call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); [L33] havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L20-L108] ensures true; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret28=6.442450962E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L114] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L111-L123] ensures true; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume #t~short33; [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149-L152] assume #t~short33; [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=6442450951, one_modf=1] [L144] double x = -1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=6442450962, iptr={6442450955:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=6442450962, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L30] COND TRUE j0 < 20 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L31] COND TRUE j0 < 0 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [\old(x)=6442450962, \result=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L146] RET, EXPR modf_double(x, &iptr) VAL [iptr={6442450955:0}, modf_double(x, &iptr)=6442450962, one_modf=1, x=6442450962] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=6442450953, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=6442450953, one_modf=1, x=6442450953] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450953, \result=2, hx=2146435072, lx=-2147483648, one_modf=1, x=6442450953] [L149] RET, EXPR isinf_double(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, one_modf=1, res=6442450962, x=6442450962] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=6442450962, res == -0.0 && __signbit_double(res) == 1=0, x=6442450962] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=6442450962, res == -0.0 && __signbit_double(res) == 1=0, x=6442450962] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] ----- [2018-11-22 23:59:59,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:59:59 BoogieIcfgContainer [2018-11-22 23:59:59,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:59:59,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:59:59,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:59:59,093 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:59:59,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:59:58" (3/4) ... [2018-11-22 23:59:59,100 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:59:59,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:59:59,101 INFO L168 Benchmark]: Toolchain (without parser) took 1282.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -83.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,102 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:59:59,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.96 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,104 INFO L168 Benchmark]: Boogie Preprocessor took 35.25 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,109 INFO L168 Benchmark]: RCFGBuilder took 414.07 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: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,110 INFO L168 Benchmark]: TraceAbstraction took 549.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:59:59,110 INFO L168 Benchmark]: Witness Printer took 8.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:59:59,115 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.96 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.25 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.07 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: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 549.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * Witness Printer took 8.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=6442450951, one_modf=1] [L144] double x = -1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=6442450962, iptr={6442450955:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=6442450962, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L30] COND TRUE j0 < 20 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L31] COND TRUE j0 < 0 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [\old(x)=6442450962, \result=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L146] RET, EXPR modf_double(x, &iptr) VAL [iptr={6442450955:0}, modf_double(x, &iptr)=6442450962, one_modf=1, x=6442450962] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=6442450953, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=6442450953, one_modf=1, x=6442450953] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450953, \result=2, hx=2146435072, lx=-2147483648, one_modf=1, x=6442450953] [L149] RET, EXPR isinf_double(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, one_modf=1, res=6442450962, x=6442450962] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=6442450962, res == -0.0 && __signbit_double(res) == 1=0, x=6442450962] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=6442450962, res == -0.0 && __signbit_double(res) == 1=0, x=6442450962] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 0 SDslu, 66 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 00:00:00,622 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:00:00,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:00:00,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:00:00,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:00:00,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:00:00,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:00:00,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:00:00,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:00:00,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:00:00,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:00:00,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:00:00,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:00:00,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:00:00,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:00:00,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:00:00,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:00:00,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:00:00,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:00:00,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:00:00,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:00:00,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:00:00,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:00:00,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:00:00,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:00:00,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:00:00,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:00:00,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:00:00,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:00:00,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:00:00,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:00:00,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:00:00,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:00:00,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:00:00,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:00:00,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:00:00,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 00:00:00,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:00:00,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:00:00,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:00:00,666 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:00:00,666 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:00:00,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:00:00,666 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:00:00,666 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:00:00,667 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:00:00,667 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:00:00,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:00:00,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:00:00,668 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:00:00,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:00:00,669 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:00:00,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 00:00:00,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:00:00,671 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:00:00,671 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:00:00,671 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_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-11-23 00:00:00,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:00:00,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:00:00,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:00:00,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:00:00,716 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:00:00,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-23 00:00:00,757 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/ddaa15d43/85f5adb8434c4d84827315f0fb392ed4/FLAG54a650129 [2018-11-23 00:00:01,083 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:00:01,084 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-23 00:00:01,088 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/ddaa15d43/85f5adb8434c4d84827315f0fb392ed4/FLAG54a650129 [2018-11-23 00:00:01,096 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/data/ddaa15d43/85f5adb8434c4d84827315f0fb392ed4 [2018-11-23 00:00:01,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:00:01,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:00:01,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:01,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:00:01,104 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:00:01,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748ee420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01, skipping insertion in model container [2018-11-23 00:00:01,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:00:01,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:00:01,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:01,280 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:00:01,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:01,329 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:00:01,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01 WrapperNode [2018-11-23 00:00:01,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:01,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:01,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:00:01,331 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:00:01,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:01,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:00:01,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:00:01,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:00:01,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... [2018-11-23 00:00:01,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:00:01,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:00:01,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:00:01,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:00:01,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 00:00:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 00:00:01,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 00:00:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 00:00:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 00:00:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 00:00:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:00:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:00:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:00:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:00:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-11-23 00:00:01,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:00:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:00:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:00:01,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:00:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-23 00:00:01,464 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-23 00:00:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 00:00:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:00:01,597 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:01,627 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:01,662 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,227 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,244 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,278 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,287 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,325 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,343 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,415 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,433 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,449 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,481 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:00:02,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:00:02,484 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-23 00:00:02,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:02 BoogieIcfgContainer [2018-11-23 00:00:02,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:00:02,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:00:02,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:00:02,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:00:02,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:00:01" (1/3) ... [2018-11-23 00:00:02,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd0bbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:00:02, skipping insertion in model container [2018-11-23 00:00:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:01" (2/3) ... [2018-11-23 00:00:02,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd0bbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:00:02, skipping insertion in model container [2018-11-23 00:00:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:02" (3/3) ... [2018-11-23 00:00:02,493 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-11-23 00:00:02,500 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:00:02,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:00:02,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:00:02,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:00:02,540 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:00:02,540 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:00:02,540 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:00:02,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:00:02,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:00:02,541 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:00:02,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:00:02,541 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:00:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-23 00:00:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:00:02,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:02,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:00:02,557 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1736210886, now seen corresponding path program 1 times [2018-11-23 00:00:02,563 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:02,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:02,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:02,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:02,651 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 00:00:02,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:02,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:02,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:00:02,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:00:02,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:00:02,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:00:02,678 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-23 00:00:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:02,696 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-23 00:00:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:00:02,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 00:00:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:02,703 INFO L225 Difference]: With dead ends: 130 [2018-11-23 00:00:02,703 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 00:00:02,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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 00:00:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 00:00:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 00:00:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 00:00:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-23 00:00:02,733 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-23 00:00:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:02,733 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-23 00:00:02,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:00:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-23 00:00:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:00:02,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:02,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:00:02,735 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:02,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash 884713430, now seen corresponding path program 1 times [2018-11-23 00:00:02,737 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:02,737 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:02,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:02,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:03,013 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 00:00:03,013 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:03,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:03,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:00:03,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:00:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:00:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:00:03,023 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 7 states. [2018-11-23 00:00:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:05,944 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-23 00:00:05,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:00:05,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 00:00:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:05,947 INFO L225 Difference]: With dead ends: 94 [2018-11-23 00:00:05,947 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 00:00:05,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:00:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 00:00:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 00:00:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 00:00:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 00:00:05,955 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2018-11-23 00:00:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:05,955 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 00:00:05,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:00:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 00:00:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:00:05,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:05,956 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] [2018-11-23 00:00:05,957 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:05,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1849312616, now seen corresponding path program 1 times [2018-11-23 00:00:05,958 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:06,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:06,248 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 00:00:06,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:06,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:06,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:00:06,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:00:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:00:06,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:00:06,258 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2018-11-23 00:00:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:07,986 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-23 00:00:07,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:00:07,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 00:00:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:07,989 INFO L225 Difference]: With dead ends: 79 [2018-11-23 00:00:07,989 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 00:00:07,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:00:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 00:00:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 00:00:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:00:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 00:00:07,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-11-23 00:00:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 00:00:07,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:00:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 00:00:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:00:07,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:07,996 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] [2018-11-23 00:00:07,996 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 109713720, now seen corresponding path program 1 times [2018-11-23 00:00:07,997 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:08,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:08,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:08,291 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 00:00:08,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:08,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:08,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:00:08,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:00:08,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:00:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:00:08,304 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 3 states. [2018-11-23 00:00:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:08,314 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 00:00:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:00:08,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 00:00:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:08,315 INFO L225 Difference]: With dead ends: 46 [2018-11-23 00:00:08,315 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 00:00:08,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 00:00:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 00:00:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 00:00:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:00:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 00:00:08,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-11-23 00:00:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:08,322 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 00:00:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:00:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 00:00:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 00:00:08,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:08,323 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] [2018-11-23 00:00:08,323 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:08,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1949699601, now seen corresponding path program 1 times [2018-11-23 00:00:08,324 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:08,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:08,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-23 00:00:08,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 00:00:08,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 00:00:08,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:00:08,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:00:08,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:00:08,646 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 00:00:08,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 00:00:08,714 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 00:00:08,714 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:08,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:08,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:00:08,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:00:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:00:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:00:08,726 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-11-23 00:00:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:09,524 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-11-23 00:00:09,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:00:09,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 00:00:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:09,525 INFO L225 Difference]: With dead ends: 47 [2018-11-23 00:00:09,526 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 00:00:09,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:00:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 00:00:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 00:00:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:00:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-11-23 00:00:09,530 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 34 [2018-11-23 00:00:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:09,531 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-11-23 00:00:09,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:00:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-11-23 00:00:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 00:00:09,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:09,532 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, 1, 1, 1] [2018-11-23 00:00:09,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:09,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1420899646, now seen corresponding path program 1 times [2018-11-23 00:00:09,532 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:00:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/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 00:00:09,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:09,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:00:09,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 00:00:09,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 00:00:09,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 00:00:09,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:00:09,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:00:09,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:00:09,896 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 00:00:09,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 00:00:10,244 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 00:00:10,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:00:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 00:00:10,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 00:00:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 00:00:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:00:10,261 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 15 states. [2018-11-23 00:00:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:17,917 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-11-23 00:00:17,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 00:00:17,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-23 00:00:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:17,918 INFO L225 Difference]: With dead ends: 43 [2018-11-23 00:00:17,918 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:00:17,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-11-23 00:00:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:00:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:00:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:00:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:00:17,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-11-23 00:00:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:17,919 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:00:17,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 00:00:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:00:17,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:00:17,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:00:18,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 111 123) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L451 ceAbstractionStarter]: At program point L113-2(lines 113 118) the Hoare annotation is: true [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 111 123) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 111 123) the Hoare annotation is: true [2018-11-23 00:00:18,438 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-11-23 00:00:18,438 INFO L444 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 125 135) no Hoare annotation was computed. [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 125 135) no Hoare annotation was computed. [2018-11-23 00:00:18,439 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 125 135) the Hoare annotation is: true [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:00:18,439 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 00:00:18,439 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:00:18,439 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 137 155) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L444 ceAbstractionStarter]: At program point L149(line 149) the Hoare annotation is: (and (exists ((v_prenex_19 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_19)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0)) [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point L149-2(line 149) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L444 ceAbstractionStarter]: At program point L149-4(line 149) the Hoare annotation is: (and (exists ((v_prenex_19 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_19)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) |main_#t~short32|) [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point L149-5(line 149) no Hoare annotation was computed. [2018-11-23 00:00:18,440 INFO L448 ceAbstractionStarter]: For program point L149-7(line 149) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 137 155) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point L149-9(lines 149 152) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 137 155) the Hoare annotation is: true [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L444 ceAbstractionStarter]: At program point L146(line 146) the Hoare annotation is: (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point L146-1(line 146) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2018-11-23 00:00:18,441 INFO L444 ceAbstractionStarter]: At program point L44-2(lines 44 48) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 00:00:18,441 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2018-11-23 00:00:18,442 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 00:00:18,442 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2018-11-23 00:00:18,442 INFO L444 ceAbstractionStarter]: At program point L86-2(lines 86 90) the Hoare annotation is: (and (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (not (bvsgt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) (_ bv51 32))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 00:00:18,442 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2018-11-23 00:00:18,442 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2018-11-23 00:00:18,442 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2018-11-23 00:00:18,442 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 28) the Hoare annotation is: (= |modf_double_#in~x| modf_double_~x) [2018-11-23 00:00:18,442 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point modf_doubleFINAL(lines 20 108) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L444 ceAbstractionStarter]: At program point L57-2(lines 57 62) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2018-11-23 00:00:18,443 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2018-11-23 00:00:18,444 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 104) the Hoare annotation is: (and (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (not (bvsgt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) (_ bv51 32))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L448 ceAbstractionStarter]: For program point modf_doubleEXIT(lines 20 108) no Hoare annotation was computed. [2018-11-23 00:00:18,445 INFO L451 ceAbstractionStarter]: At program point modf_doubleENTRY(lines 20 108) the Hoare annotation is: true [2018-11-23 00:00:18,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:00:18 BoogieIcfgContainer [2018-11-23 00:00:18,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:00:18,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:00:18,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:00:18,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:00:18,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:02" (3/4) ... [2018-11-23 00:00:18,499 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:00:18,504 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:00:18,504 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 00:00:18,504 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 00:00:18,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:00:18,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure modf_double [2018-11-23 00:00:18,510 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2018-11-23 00:00:18,510 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 00:00:18,510 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 00:00:18,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 00:00:18,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 00:00:18,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 00:00:18,560 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70f73a0e-c0b8-4acb-a51b-c9b78049e61a/bin-2019/utaipan/witness.graphml [2018-11-23 00:00:18,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:00:18,561 INFO L168 Benchmark]: Toolchain (without parser) took 17461.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:18,562 INFO L168 Benchmark]: CDTParser took 0.16 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 00:00:18,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.83 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 00:00:18,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:18,563 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:00:18,563 INFO L168 Benchmark]: RCFGBuilder took 1057.34 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: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:18,563 INFO L168 Benchmark]: TraceAbstraction took 16009.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:00:18,563 INFO L168 Benchmark]: Witness Printer took 64.87 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:18,565 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.16 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 229.83 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 61.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1057.34 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: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16009.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 64.87 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 99]: Loop Invariant [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 57]: Loop Invariant [2018-11-23 00:00:18,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - InvariantResult [Line: 69]: Loop Invariant [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (\old(x) == x && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 00:00:18,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 86]: Loop Invariant [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 00:00:18,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 44]: Loop Invariant [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 00:00:18,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. SAFE Result, 15.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 277 SDtfs, 228 SDslu, 849 SDs, 0 SdLazy, 311 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 31 PreInvPairs, 42 NumberOfFragments, 473 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 190 ConstructedInterpolants, 43 QuantifiedInterpolants, 45514 SizeOfPredicates, 20 NumberOfNonLiveVariables, 667 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...