./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................. 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/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-10-22 11:20:57,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:57,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:57,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:57,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:57,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:57,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:57,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:57,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:57,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:57,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:57,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:57,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:57,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:57,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:57,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:57,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:57,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:57,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:57,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:57,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:57,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:57,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:57,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:57,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:57,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:57,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:57,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:57,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:57,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:57,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:57,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:57,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:57,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:57,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:57,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:57,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:57,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:57,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:57,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:57,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:57,572 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:57,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:57,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:57,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:57,584 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:57,584 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:57,584 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:57,584 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:57,585 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:57,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:57,585 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:57,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:57,586 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:57,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:57,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:57,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:57,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:57,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:57,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:57,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:57,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:57,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:57,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:57,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:57,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:57,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:57,590 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/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-10-22 11:20:57,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:57,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:57,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:57,643 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:57,643 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:57,644 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-10-22 11:20:57,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/decf6f1a6/cc0ab74b96bb488daf3074b7d6ec53fd/FLAGdf644ad5a [2019-10-22 11:20:58,102 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:58,102 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-10-22 11:20:58,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/decf6f1a6/cc0ab74b96bb488daf3074b7d6ec53fd/FLAGdf644ad5a [2019-10-22 11:20:58,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/decf6f1a6/cc0ab74b96bb488daf3074b7d6ec53fd [2019-10-22 11:20:58,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:58,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:58,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:58,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:58,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:58,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717ba0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:58,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:58,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:58,400 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:58,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:58,456 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:58,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58 WrapperNode [2019-10-22 11:20:58,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:58,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:58,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:58,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:58,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:58,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:58,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:58,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:58,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... [2019-10-22 11:20:58,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:58,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:58,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:58,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:58,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:20:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:20:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-10-22 11:20:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:20:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 11:20:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:58,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-10-22 11:20:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:20:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:20:59,233 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:59,234 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 11:20:59,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:59 BoogieIcfgContainer [2019-10-22 11:20:59,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:59,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:59,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:59,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:59,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:58" (1/3) ... [2019-10-22 11:20:59,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a259c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:59, skipping insertion in model container [2019-10-22 11:20:59,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:58" (2/3) ... [2019-10-22 11:20:59,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a259c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:59, skipping insertion in model container [2019-10-22 11:20:59,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:59" (3/3) ... [2019-10-22 11:20:59,242 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-10-22 11:20:59,250 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:59,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:20:59,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:20:59,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:59,299 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:59,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:59,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:59,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:59,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:59,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:59,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-22 11:20:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:20:59,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,320 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,326 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-10-22 11:20:59,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999540320] [2019-10-22 11:20:59,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999540320] [2019-10-22 11:20:59,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327434248] [2019-10-22 11:20:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:20:59,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:20:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:20:59,454 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-10-22 11:20:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,473 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-10-22 11:20:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:20:59,474 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-22 11:20:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,484 INFO L225 Difference]: With dead ends: 102 [2019-10-22 11:20:59,484 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:20:59,487 INFO L600 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-10-22 11:20:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:20:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 11:20:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:20:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-10-22 11:20:59,520 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-10-22 11:20:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,520 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-10-22 11:20:59,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:20:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-10-22 11:20:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:20:59,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,522 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-10-22 11:20:59,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201465888] [2019-10-22 11:20:59,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201465888] [2019-10-22 11:20:59,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266938941] [2019-10-22 11:20:59,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,625 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-10-22 11:20:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,641 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-22 11:20:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:20:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,642 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:20:59,643 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:20:59,646 INFO L600 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-10-22 11:20:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:20:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 11:20:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:20:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-10-22 11:20:59,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-10-22 11:20:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,651 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-10-22 11:20:59,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-10-22 11:20:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:20:59,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,655 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-10-22 11:20:59,656 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097829818] [2019-10-22 11:20:59,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:20:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:20:59,881 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:20:59,882 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:20:59,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:20:59 BoogieIcfgContainer [2019-10-22 11:20:59,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:20:59,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:20:59,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:20:59,919 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:20:59,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:59" (3/4) ... [2019-10-22 11:20:59,924 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:20:59,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:20:59,926 INFO L168 Benchmark]: Toolchain (without parser) took 1804.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.9 MB in the beginning and 1.0 GB in the end (delta: -77.4 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,927 INFO L168 Benchmark]: CDTParser took 0.18 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-10-22 11:20:59,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,928 INFO L168 Benchmark]: Boogie Preprocessor took 41.27 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-10-22 11:20:59,929 INFO L168 Benchmark]: RCFGBuilder took 690.69 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,930 INFO L168 Benchmark]: TraceAbstraction took 682.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,931 INFO L168 Benchmark]: Witness Printer took 5.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:20:59,934 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.18 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 335.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.27 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 690.69 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 682.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [one_modf=1] [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); VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 0 SDslu, 49 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=52occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 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-cad4683 [2019-10-22 11:21:01,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:01,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:01,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:01,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:01,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:01,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:01,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:01,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:01,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:01,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:01,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:01,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:01,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:01,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:01,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:01,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:01,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:01,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:01,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:01,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:01,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:01,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:01,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:01,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:01,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:01,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:01,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:01,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:01,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:01,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:01,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:01,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:01,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:01,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:01,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:01,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:01,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:01,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:01,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:01,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:01,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:01,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:01,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:01,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:01,984 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:01,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:01,985 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:01,985 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:01,985 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:01,985 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:01,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:01,986 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:01,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:01,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:01,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:01,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:01,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:01,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:01,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:01,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:01,989 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:01,989 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:01,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:01,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:01,989 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/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2019-10-22 11:21:02,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:02,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:02,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:02,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:02,041 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:02,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-10-22 11:21:02,090 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/7bab89810/e309d093e4ec45beaa2b4e183f367ace/FLAGfc19d7a34 [2019-10-22 11:21:02,473 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:02,474 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-10-22 11:21:02,480 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/7bab89810/e309d093e4ec45beaa2b4e183f367ace/FLAGfc19d7a34 [2019-10-22 11:21:02,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/bin/utaipan/data/7bab89810/e309d093e4ec45beaa2b4e183f367ace [2019-10-22 11:21:02,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:02,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:02,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:02,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:02,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@607c200f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02, skipping insertion in model container [2019-10-22 11:21:02,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,511 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:02,529 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:02,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:02,760 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:02,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:02,894 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:02,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02 WrapperNode [2019-10-22 11:21:02,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:02,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:02,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:02,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:02,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:02,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:02,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:02,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:02,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:02,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:02,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:02,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-10-22 11:21:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-10-22 11:21:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-10-22 11:21:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:21:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:21:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:04,334 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:04,334 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 11:21:04,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:04 BoogieIcfgContainer [2019-10-22 11:21:04,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:04,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:04,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:04,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:04,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:02" (1/3) ... [2019-10-22 11:21:04,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1760c284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:04, skipping insertion in model container [2019-10-22 11:21:04,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (2/3) ... [2019-10-22 11:21:04,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1760c284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:04, skipping insertion in model container [2019-10-22 11:21:04,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:04" (3/3) ... [2019-10-22 11:21:04,343 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-10-22 11:21:04,352 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:04,359 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:04,370 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:04,390 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:04,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:04,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:04,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:04,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:04,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:04,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:04,391 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-22 11:21:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:04,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,411 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-10-22 11:21:04,425 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:04,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156752070] [2019-10-22 11:21:04,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,545 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156752070] [2019-10-22 11:21:04,554 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:21:04,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556023069] [2019-10-22 11:21:04,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:04,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:04,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:04,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:04,574 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-10-22 11:21:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,596 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-10-22 11:21:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:04,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-22 11:21:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,608 INFO L225 Difference]: With dead ends: 102 [2019-10-22 11:21:04,608 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:21:04,611 INFO L600 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-10-22 11:21:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:21:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 11:21:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:21:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-10-22 11:21:04,643 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-10-22 11:21:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,643 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-10-22 11:21:04,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-10-22 11:21:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:04,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 11:21:04,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-10-22 11:21:04,850 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:04,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198437550] [2019-10-22 11:21:04,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:05,073 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:05,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198437550] [2019-10-22 11:21:05,187 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-22 11:21:05,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381838083] [2019-10-22 11:21:05,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:05,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:05,193 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-10-22 11:21:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,659 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-10-22 11:21:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:05,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-10-22 11:21:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,661 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:21:05,661 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:21:05,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:21:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:21:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:21:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:21:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-22 11:21:05,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-10-22 11:21:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,668 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-22 11:21:05,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-22 11:21:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:21:05,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,669 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 11:21:05,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-10-22 11:21:05,871 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:05,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865019651] [2019-10-22 11:21:05,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:06,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,331 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865019651] [2019-10-22 11:21:06,334 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:06,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994642555] [2019-10-22 11:21:06,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:06,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:06,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:06,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:06,336 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-10-22 11:21:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:06,359 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-10-22 11:21:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:06,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 11:21:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:06,360 INFO L225 Difference]: With dead ends: 30 [2019-10-22 11:21:06,361 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:21:06,361 INFO L600 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-10-22 11:21:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:21:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:21:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:21:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-10-22 11:21:06,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-10-22 11:21:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,367 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-10-22 11:21:06,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-10-22 11:21:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:06,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,369 INFO L380 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-10-22 11:21:06,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 11:21:06,570 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-10-22 11:21:06,571 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:06,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846669398] [2019-10-22 11:21:06,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:21:07,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:07,032 INFO L375 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-10-22 11:21:07,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:07,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:07,046 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:07,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:07,051 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-10-22 11:21:07,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-10-22 11:21:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:07,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846669398] [2019-10-22 11:21:07,188 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:07,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-10-22 11:21:07,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35599036] [2019-10-22 11:21:07,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:07,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:07,191 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-10-22 11:21:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,019 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-10-22 11:21:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:08,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:21:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,022 INFO L225 Difference]: With dead ends: 31 [2019-10-22 11:21:08,022 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:21:08,022 INFO L600 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-10-22 11:21:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:21:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:21:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:21:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-10-22 11:21:08,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-10-22 11:21:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,027 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-10-22 11:21:08,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-10-22 11:21:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:08,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,028 INFO L380 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-10-22 11:21:08,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 11:21:08,229 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-10-22 11:21:08,230 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:08,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591596889] [2019-10-22 11:21:08,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b4e40d5-625a-4b88-ae3d-b7c49dac723f/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-10-22 11:21:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 11:21:08,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:08,634 INFO L375 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-10-22 11:21:08,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:08,641 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:08,655 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-10-22 11:21:08,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:40 [2019-10-22 11:21:08,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,875 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:08,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:09,189 INFO L375 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-10-22 11:21:09,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:09,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:09,201 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-10-22 11:21:09,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:36 [2019-10-22 11:21:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591596889] [2019-10-22 11:21:09,331 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-10-22 11:21:09,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394938396] [2019-10-22 11:21:09,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:21:09,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:21:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:21:09,333 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-10-22 11:21:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,992 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-10-22 11:21:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:10,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-22 11:21:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,993 INFO L225 Difference]: With dead ends: 27 [2019-10-22 11:21:10,993 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:10,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-10-22 11:21:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:10,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-10-22 11:21:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,994 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:10,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:21:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:10,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:11,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 11:21:11,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:11,392 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-22 11:21:11,508 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-22 11:21:11,712 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-10-22 11:21:11,858 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-22 11:21:11,951 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-10-22 11:21:11,951 INFO L439 ceAbstractionStarter]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-10-22 11:21:11,951 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-10-22 11:21:11,951 INFO L439 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-10-22 11:21:11,951 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:11,951 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:11,951 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-10-22 11:21:11,952 INFO L439 ceAbstractionStarter]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-10-22 11:21:11,952 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-22 11:21:11,952 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-10-22 11:21:11,952 INFO L439 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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|) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ULTIMATE.start_main_~res~0 (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)))) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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))) (and (= (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___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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))))) [2019-10-22 11:21:11,952 INFO L443 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-10-22 11:21:11,952 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-10-22 11:21:11,952 INFO L446 ceAbstractionStarter]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-10-22 11:21:11,952 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-10-22 11:21:11,953 INFO L439 ceAbstractionStarter]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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|) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ULTIMATE.start_main_~res~0 (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)))) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3))))) [2019-10-22 11:21:11,953 INFO L443 ceAbstractionStarter]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-10-22 11:21:11,953 INFO L439 ceAbstractionStarter]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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|) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3))))) [2019-10-22 11:21:11,953 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-10-22 11:21:11,953 INFO L439 ceAbstractionStarter]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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|) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ULTIMATE.start_main_~res~0 (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)))) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3))))) [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 28) the Hoare annotation is: (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x) [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-10-22 11:21:11,954 INFO L439 ceAbstractionStarter]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-10-22 11:21:11,955 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-10-22 11:21:11,956 INFO L443 ceAbstractionStarter]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-10-22 11:21:11,957 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-22 11:21:11,957 INFO L439 ceAbstractionStarter]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (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 ((.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)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= (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_~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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (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_modf_double_#res|) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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 ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (and (= ULTIMATE.start_main_~res~0 (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)))) (= (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 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))) (and (= (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___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 roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))))) [2019-10-22 11:21:11,960 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:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:21:11,963 INFO L168 Benchmark]: Toolchain (without parser) took 9466.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,963 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:11,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -212.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.92 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-10-22 11:21:11,965 INFO L168 Benchmark]: Boogie Preprocessor took 50.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,966 INFO L168 Benchmark]: RCFGBuilder took 1343.69 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,966 INFO L168 Benchmark]: TraceAbstraction took 7624.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,969 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -212.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.92 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 50.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1343.69 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7624.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.8 MB). Peak memory consumption was 25.2 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...