./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 98b359d4210eaa0693e17be51fa07ce179f3b890 ........................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 98b359d4210eaa0693e17be51fa07ce179f3b890 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:48:32,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:48:32,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:48:32,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:48:32,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:48:32,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:48:32,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:48:32,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:48:32,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:48:32,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:48:32,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:48:32,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:48:32,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:48:32,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:48:32,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:48:32,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:48:32,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:48:32,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:48:32,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:48:32,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:48:32,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:48:32,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:48:32,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:48:32,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:48:32,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:48:32,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:48:32,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:48:32,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:48:32,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:48:32,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:48:32,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:48:32,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:48:32,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:48:32,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:48:32,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:48:32,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:48:32,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:48:32,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:48:32,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:48:32,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:48:32,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:48:32,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:48:32,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:48:32,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:48:32,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:48:32,468 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:48:32,468 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:48:32,468 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:48:32,468 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:48:32,468 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:48:32,468 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:48:32,469 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:48:32,469 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:48:32,470 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:48:32,470 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:48:32,470 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:48:32,470 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:48:32,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:48:32,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:48:32,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:48:32,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:48:32,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:48:32,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:48:32,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:48:32,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:48:32,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:48:32,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:48:32,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:48:32,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:48:32,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:48:32,474 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:48:32,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:48:32,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:48:32,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:48:32,475 INFO L138 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/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-26 02:48:32,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:48:32,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:48:32,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:48:32,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:48:32,684 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:48:32,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-26 02:48:32,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/89e91b5ed/d38fb3470d7f43acbbd8eedbe05a678e/FLAG5b15a96f5 [2019-11-26 02:48:33,170 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:48:33,171 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-26 02:48:33,177 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/89e91b5ed/d38fb3470d7f43acbbd8eedbe05a678e/FLAG5b15a96f5 [2019-11-26 02:48:33,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/89e91b5ed/d38fb3470d7f43acbbd8eedbe05a678e [2019-11-26 02:48:33,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:48:33,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:48:33,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:33,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:48:33,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:48:33,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:33" (1/1) ... [2019-11-26 02:48:33,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb84ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:33, skipping insertion in model container [2019-11-26 02:48:33,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:33" (1/1) ... [2019-11-26 02:48:33,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:48:33,627 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:48:33,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:33,976 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:48:34,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:34,054 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:48:34,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34 WrapperNode [2019-11-26 02:48:34,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:34,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:34,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:48:34,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:48:34,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:34,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:48:34,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:48:34,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:48:34,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... [2019-11-26 02:48:34,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:48:34,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:48:34,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:48:34,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:48:34,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:34,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:48:34,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-26 02:48:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:48:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-26 02:48:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:48:34,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:48:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-26 02:48:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:48:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:48:34,868 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:48:34,868 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-26 02:48:34,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:34 BoogieIcfgContainer [2019-11-26 02:48:34,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:48:34,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:48:34,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:48:34,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:48:34,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:48:33" (1/3) ... [2019-11-26 02:48:34,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d41beed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:34, skipping insertion in model container [2019-11-26 02:48:34,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:34" (2/3) ... [2019-11-26 02:48:34,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d41beed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:34, skipping insertion in model container [2019-11-26 02:48:34,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:34" (3/3) ... [2019-11-26 02:48:34,877 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-26 02:48:34,885 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:48:34,890 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:48:34,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:48:34,921 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:48:34,921 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:48:34,922 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:48:34,922 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:48:34,922 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:48:34,922 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:48:34,922 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:48:34,922 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:48:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-26 02:48:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:48:34,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:34,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:34,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1127906452, now seen corresponding path program 1 times [2019-11-26 02:48:34,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:48:34,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736010296] [2019-11-26 02:48:34,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:48:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:35,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736010296] [2019-11-26 02:48:35,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:35,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:48:35,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935031940] [2019-11-26 02:48:35,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:48:35,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:48:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:48:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:48:35,081 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2019-11-26 02:48:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:35,101 INFO L93 Difference]: Finished difference Result 95 states and 157 transitions. [2019-11-26 02:48:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:48:35,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-11-26 02:48:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:35,112 INFO L225 Difference]: With dead ends: 95 [2019-11-26 02:48:35,112 INFO L226 Difference]: Without dead ends: 46 [2019-11-26 02:48:35,115 INFO L630 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 [2019-11-26 02:48:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-26 02:48:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-26 02:48:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-26 02:48:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-26 02:48:35,146 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2019-11-26 02:48:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:35,147 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-26 02:48:35,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:48:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-26 02:48:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:48:35,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:35,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:35,148 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2081590925, now seen corresponding path program 1 times [2019-11-26 02:48:35,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:48:35,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195550633] [2019-11-26 02:48:35,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:48:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:35,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195550633] [2019-11-26 02:48:35,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:35,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:48:35,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711392556] [2019-11-26 02:48:35,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:48:35,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:48:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:48:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:48:35,309 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2019-11-26 02:48:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:35,328 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-26 02:48:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:48:35,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-26 02:48:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:35,335 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:48:35,335 INFO L226 Difference]: Without dead ends: 46 [2019-11-26 02:48:35,336 INFO L630 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 [2019-11-26 02:48:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-26 02:48:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-26 02:48:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-26 02:48:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-11-26 02:48:35,343 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 16 [2019-11-26 02:48:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:35,343 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-11-26 02:48:35,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:48:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-11-26 02:48:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:48:35,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:35,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:35,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1023477821, now seen corresponding path program 1 times [2019-11-26 02:48:35,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:48:35,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940004875] [2019-11-26 02:48:35,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:48:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:48:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:48:35,636 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:48:35,636 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:48:35,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:48:35 BoogieIcfgContainer [2019-11-26 02:48:35,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:48:35,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:48:35,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:48:35,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:48:35,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:34" (3/4) ... [2019-11-26 02:48:35,707 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:48:35,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:48:35,718 INFO L168 Benchmark]: Toolchain (without parser) took 2129.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -105.1 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:35,718 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:35,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:35,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:35,720 INFO L168 Benchmark]: Boogie Preprocessor took 44.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:35,721 INFO L168 Benchmark]: RCFGBuilder took 713.80 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:35,722 INFO L168 Benchmark]: TraceAbstraction took 830.91 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: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:35,723 INFO L168 Benchmark]: Witness Printer took 12.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:35,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 713.80 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 830.91 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: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Witness Printer took 12.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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; [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [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 [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [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 [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [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); [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 106 SDtfs, 0 SDslu, 46 SDs, 0 SdLazy, 5 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=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-6b5699a [2019-11-26 02:48:37,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:48:37,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:48:37,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:48:37,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:48:37,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:48:37,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:48:37,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:48:37,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:48:37,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:48:37,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:48:37,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:48:37,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:48:37,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:48:37,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:48:37,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:48:37,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:48:37,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:48:37,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:48:37,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:48:37,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:48:37,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:48:37,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:48:37,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:48:37,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:48:37,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:48:37,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:48:37,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:48:37,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:48:37,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:48:37,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:48:37,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:48:37,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:48:37,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:48:37,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:48:37,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:48:37,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:48:37,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:48:37,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:48:37,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:48:37,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:48:37,832 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:48:37,856 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:48:37,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:48:37,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:48:37,857 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:48:37,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:48:37,858 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:48:37,858 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:48:37,858 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:48:37,859 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:48:37,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:48:37,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:48:37,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:48:37,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:48:37,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:48:37,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:48:37,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:48:37,861 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:48:37,861 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:48:37,861 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:48:37,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:48:37,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:48:37,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:48:37,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:48:37,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:48:37,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:48:37,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:48:37,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:48:37,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:48:37,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:48:37,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:48:37,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:48:37,864 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:48:37,864 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:48:37,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:48:37,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:48:37,874 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-26 02:48:38,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:48:38,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:48:38,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:48:38,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:48:38,172 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:48:38,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-26 02:48:38,233 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/ff578bbdb/cd33833bd3b74c0ba2fd69198484f58b/FLAG35a0cb719 [2019-11-26 02:48:38,588 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:48:38,588 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-26 02:48:38,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/ff578bbdb/cd33833bd3b74c0ba2fd69198484f58b/FLAG35a0cb719 [2019-11-26 02:48:38,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/utaipan/data/ff578bbdb/cd33833bd3b74c0ba2fd69198484f58b [2019-11-26 02:48:38,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:48:38,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:48:38,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:38,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:48:38,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:48:38,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:38" (1/1) ... [2019-11-26 02:48:38,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5150de40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:38, skipping insertion in model container [2019-11-26 02:48:38,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:38" (1/1) ... [2019-11-26 02:48:38,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:48:39,013 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:48:39,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:39,283 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:48:39,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:39,423 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:48:39,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39 WrapperNode [2019-11-26 02:48:39,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:39,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:39,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:48:39,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:48:39,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:39,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:48:39,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:48:39,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:48:39,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... [2019-11-26 02:48:39,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:48:39,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:48:39,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:48:39,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:48:39,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-26 02:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-26 02:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-26 02:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:48:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:48:39,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:48:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:48:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:48:40,757 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:48:40,757 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-26 02:48:40,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:40 BoogieIcfgContainer [2019-11-26 02:48:40,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:48:40,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:48:40,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:48:40,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:48:40,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:48:38" (1/3) ... [2019-11-26 02:48:40,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273eab34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:40, skipping insertion in model container [2019-11-26 02:48:40,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:39" (2/3) ... [2019-11-26 02:48:40,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273eab34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:40, skipping insertion in model container [2019-11-26 02:48:40,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:40" (3/3) ... [2019-11-26 02:48:40,769 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-26 02:48:40,778 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:48:40,784 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:48:40,794 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:48:40,816 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:48:40,816 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:48:40,816 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:48:40,816 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:48:40,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:48:40,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:48:40,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:48:40,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:48:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-26 02:48:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:48:40,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:40,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:40,842 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-26 02:48:40,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:40,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479353287] [2019-11-26 02:48:40,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:40,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-26 02:48:41,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:41,020 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:41,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479353287] [2019-11-26 02:48:41,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:41,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:48:41,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854232645] [2019-11-26 02:48:41,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:48:41,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:41,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:48:41,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:48:41,052 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-26 02:48:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:41,084 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-26 02:48:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:48:41,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-26 02:48:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:41,106 INFO L225 Difference]: With dead ends: 102 [2019-11-26 02:48:41,106 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:48:41,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:48:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:48:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:48:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:48:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-26 02:48:41,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-26 02:48:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:41,158 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-26 02:48:41,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:48:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-26 02:48:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:48:41,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:41,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:41,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 02:48:41,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-26 02:48:41,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:41,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075953392] [2019-11-26 02:48:41,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:41,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:48:41,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:41,675 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:41,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075953392] [2019-11-26 02:48:41,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:41,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-26 02:48:41,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987484823] [2019-11-26 02:48:41,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:48:41,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:48:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:48:41,826 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-26 02:48:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:42,669 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-26 02:48:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:48:42,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-26 02:48:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:42,671 INFO L225 Difference]: With dead ends: 64 [2019-11-26 02:48:42,671 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:48:42,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:48:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:48:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-26 02:48:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-26 02:48:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-26 02:48:42,678 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-26 02:48:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:42,679 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-26 02:48:42,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:48:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-26 02:48:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:48:42,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:42,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:42,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 02:48:42,897 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-26 02:48:42,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:42,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980584823] [2019-11-26 02:48:42,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:43,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:48:43,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:43,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:43,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980584823] [2019-11-26 02:48:43,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:43,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:48:43,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812409484] [2019-11-26 02:48:43,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:48:43,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:43,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:48:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:48:43,403 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-26 02:48:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:43,447 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-26 02:48:43,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:48:43,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:48:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:43,449 INFO L225 Difference]: With dead ends: 30 [2019-11-26 02:48:43,449 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:48:43,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:48:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:48:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-26 02:48:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-26 02:48:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-26 02:48:43,455 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-26 02:48:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-26 02:48:43,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:48:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-26 02:48:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:48:43,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:43,457 INFO L410 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] [2019-11-26 02:48:43,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 02:48:43,670 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-26 02:48:43,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:43,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59140830] [2019-11-26 02:48:43,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:44,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:48:44,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:44,140 INFO L377 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 [2019-11-26 02:48:44,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:44,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:44,148 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:44,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:44,152 INFO L496 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. [2019-11-26 02:48:44,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-26 02:48:44,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:44,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:44,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59140830] [2019-11-26 02:48:44,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:44,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-26 02:48:44,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105690878] [2019-11-26 02:48:44,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:48:44,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:48:44,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:48:44,315 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-26 02:48:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:44,848 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-26 02:48:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:48:44,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-26 02:48:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:44,851 INFO L225 Difference]: With dead ends: 31 [2019-11-26 02:48:44,851 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:48:44,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:48:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:48:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-26 02:48:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-26 02:48:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-26 02:48:44,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-26 02:48:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:44,857 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-26 02:48:44,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:48:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-26 02:48:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:48:44,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:44,858 INFO L410 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] [2019-11-26 02:48:45,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 02:48:45,061 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:48:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-26 02:48:45,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:45,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014822203] [2019-11-26 02:48:45,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2263551d-6fed-43c9-af9d-3d129a06bfb4/bin/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 [2019-11-26 02:48:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:45,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 02:48:45,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:45,577 INFO L377 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 [2019-11-26 02:48:45,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:45,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:45,590 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:45,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:45,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:45,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:39 [2019-11-26 02:48:45,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:46,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:46,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:46,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:46,682 INFO L377 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 58 treesize of output 52 [2019-11-26 02:48:46,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:46,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:46,687 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:46,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:46,694 INFO L496 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. [2019-11-26 02:48:46,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2019-11-26 02:48:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:46,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014822203] [2019-11-26 02:48:46,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:46,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-26 02:48:46,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679886552] [2019-11-26 02:48:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 02:48:46,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 02:48:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:48:46,891 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-26 02:48:49,582 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-26 02:48:49,813 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-26 02:48:50,093 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-26 02:48:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:50,094 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-26 02:48:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:48:50,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-26 02:48:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:50,095 INFO L225 Difference]: With dead ends: 27 [2019-11-26 02:48:50,095 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:48:50,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-26 02:48:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:48:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:48:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:48:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:48:50,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-26 02:48:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:50,097 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:48:50,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 02:48:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:48:50,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:48:50,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 02:48:50,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:48:50,735 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-26 02:48:51,016 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-26 02:48:51,524 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-26 02:48:51,920 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-26 02:48:52,125 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-26 02:48:52,189 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-26 02:48:52,189 INFO L440 ceAbstractionStarter]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-26 02:48:52,189 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-26 02:48:52,190 INFO L440 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3))))) [2019-11-26 02:48:52,190 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:48:52,190 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-26 02:48:52,190 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-26 02:48:52,190 INFO L440 ceAbstractionStarter]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-26 02:48:52,190 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-26 02:48:52,191 INFO L440 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ULTIMATE.start___signbit_double_~x) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-26 02:48:52,191 INFO L444 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-26 02:48:52,191 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-26 02:48:52,191 INFO L447 ceAbstractionStarter]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-26 02:48:52,191 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-26 02:48:52,191 INFO L440 ceAbstractionStarter]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-26 02:48:52,191 INFO L444 ceAbstractionStarter]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-26 02:48:52,192 INFO L440 ceAbstractionStarter]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-26 02:48:52,192 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-26 02:48:52,192 INFO L440 ceAbstractionStarter]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-26 02:48:52,192 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-26 02:48:52,192 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L440 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L440 ceAbstractionStarter]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-26 02:48:52,193 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:48:52,194 INFO L444 ceAbstractionStarter]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-26 02:48:52,195 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-26 02:48:52,196 INFO L440 ceAbstractionStarter]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ULTIMATE.start___signbit_double_~x) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-26 02:48:52,199 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:48:52,203 INFO L168 Benchmark]: Toolchain (without parser) took 13248.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 960.5 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:52,204 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:52,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 960.5 MB in the beginning and 1.2 GB in the end (delta: -191.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:52,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:52,205 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:52,206 INFO L168 Benchmark]: RCFGBuilder took 1227.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:52,207 INFO L168 Benchmark]: TraceAbstraction took 11442.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:52,209 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 960.5 MB in the beginning and 1.2 GB in the end (delta: -191.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1227.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11442.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...