./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer --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 Automizer --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/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer --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 Automizer --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-678e011 [2019-11-20 01:06:05,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:06:05,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:06:05,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:06:05,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:06:05,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:06:05,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:06:05,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:06:05,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:06:05,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:06:05,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:06:05,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:06:05,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:06:05,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:06:05,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:06:05,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:06:05,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:06:05,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:06:05,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:06:05,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:06:05,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:06:05,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:06:05,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:06:05,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:06:05,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:06:05,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:06:05,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:06:05,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:06:05,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:06:05,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:06:05,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:06:05,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:06:05,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:06:05,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:06:05,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:06:05,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:06:05,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:06:05,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:06:05,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:06:05,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:06:05,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:06:05,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:06:05,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:06:05,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:06:05,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:06:05,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:06:05,279 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:06:05,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:06:05,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:06:05,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:06:05,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:06:05,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:06:05,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:06:05,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:06:05,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:06:05,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:06:05,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:06:05,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:06:05,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:06:05,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:06:05,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:06:05,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:06:05,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:06:05,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:06:05,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:06:05,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:06:05,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:06:05,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:06:05,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:06:05,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:06:05,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer 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 -> Automizer 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-11-20 01:06:05,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:06:05,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:06:05,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:06:05,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:06:05,493 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:06:05,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-20 01:06:05,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/1971ba24e/880ee9ba44ff4ad89ac23567572ed20a/FLAG41352b799 [2019-11-20 01:06:06,138 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:06:06,140 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-20 01:06:06,148 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/1971ba24e/880ee9ba44ff4ad89ac23567572ed20a/FLAG41352b799 [2019-11-20 01:06:06,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/1971ba24e/880ee9ba44ff4ad89ac23567572ed20a [2019-11-20 01:06:06,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:06:06,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:06:06,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:06:06,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:06:06,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:06:06,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d56047d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06, skipping insertion in model container [2019-11-20 01:06:06,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,419 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:06:06,445 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:06:06,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:06:06,773 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:06:06,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:06:06,840 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:06:06,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06 WrapperNode [2019-11-20 01:06:06,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:06:06,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:06:06,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:06:06,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:06:06,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:06:06,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:06:06,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:06:06,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:06:06,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... [2019-11-20 01:06:06,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:06:06,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:06:06,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:06:06,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:06:06,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:06:07,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:06:07,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 01:06:07,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:06:07,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 01:06:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:06:07,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:06:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 01:06:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:06:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:06:07,727 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:06:07,727 INFO L285 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-20 01:06:07,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:06:07 BoogieIcfgContainer [2019-11-20 01:06:07,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:06:07,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:06:07,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:06:07,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:06:07,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:06:06" (1/3) ... [2019-11-20 01:06:07,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d98d900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:06:07, skipping insertion in model container [2019-11-20 01:06:07,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:06" (2/3) ... [2019-11-20 01:06:07,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d98d900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:06:07, skipping insertion in model container [2019-11-20 01:06:07,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:06:07" (3/3) ... [2019-11-20 01:06:07,737 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-20 01:06:07,748 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:06:07,757 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:06:07,767 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:06:07,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:06:07,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:06:07,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:06:07,797 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:06:07,797 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:06:07,797 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:06:07,797 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:06:07,797 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:06:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-20 01:06:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:06:07,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:07,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:07,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-20 01:06:07,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:06:07,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34800393] [2019-11-20 01:06:07,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:06:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:07,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34800393] [2019-11-20 01:06:07,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:07,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:06:07,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122888262] [2019-11-20 01:06:07,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:06:07,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:06:07,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:06:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:06:08,000 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-20 01:06:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:08,027 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-20 01:06:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:06:08,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-20 01:06:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:08,042 INFO L225 Difference]: With dead ends: 102 [2019-11-20 01:06:08,042 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 01:06:08,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:06:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 01:06:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 01:06:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 01:06:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-20 01:06:08,090 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-20 01:06:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:08,091 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-20 01:06:08,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:06:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-20 01:06:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:06:08,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:08,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:08,093 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:08,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-20 01:06:08,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:06:08,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058072295] [2019-11-20 01:06:08,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:06:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:08,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058072295] [2019-11-20 01:06:08,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:08,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:06:08,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358669774] [2019-11-20 01:06:08,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:06:08,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:06:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:06:08,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:06:08,260 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-11-20 01:06:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:08,288 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-20 01:06:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:06:08,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 01:06:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:08,290 INFO L225 Difference]: With dead ends: 52 [2019-11-20 01:06:08,291 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 01:06:08,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:06:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 01:06:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 01:06:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 01:06:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-20 01:06:08,307 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-11-20 01:06:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:08,308 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-20 01:06:08,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:06:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-20 01:06:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 01:06:08,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:08,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:08,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-11-20 01:06:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:06:08,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759891671] [2019-11-20 01:06:08,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:06:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:06:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:06:08,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:06:08,657 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:06:08,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:06:08 BoogieIcfgContainer [2019-11-20 01:06:08,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:06:08,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:06:08,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:06:08,730 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:06:08,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:06:07" (3/4) ... [2019-11-20 01:06:08,740 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 01:06:08,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:06:08,743 INFO L168 Benchmark]: Toolchain (without parser) took 2341.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:08,744 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:06:08,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:08,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:08,748 INFO L168 Benchmark]: Boogie Preprocessor took 82.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:06:08,749 INFO L168 Benchmark]: RCFGBuilder took 742.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:08,751 INFO L168 Benchmark]: TraceAbstraction took 997.89 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:08,752 INFO L168 Benchmark]: Witness Printer took 11.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:06:08,760 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.90 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 742.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 997.89 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 11.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; 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.9s, 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.2s SatisfiabilityAnalysisTime, 0.1s 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-678e011 [2019-11-20 01:06:11,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:06:11,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:06:11,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:06:11,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:06:11,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:06:11,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:06:11,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:06:11,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:06:11,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:06:11,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:06:11,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:06:11,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:06:11,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:06:11,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:06:11,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:06:11,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:06:11,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:06:11,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:06:11,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:06:11,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:06:11,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:06:11,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:06:11,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:06:11,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:06:11,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:06:11,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:06:11,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:06:11,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:06:11,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:06:11,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:06:11,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:06:11,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:06:11,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:06:11,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:06:11,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:06:11,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:06:11,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:06:11,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:06:11,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:06:11,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:06:11,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:06:11,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:06:11,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:06:11,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:06:11,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:06:11,222 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:06:11,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:06:11,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:06:11,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:06:11,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:06:11,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:06:11,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:06:11,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:06:11,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:06:11,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:06:11,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:06:11,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:06:11,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:06:11,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:06:11,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:06:11,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:06:11,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:06:11,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:06:11,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:06:11,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:06:11,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:06:11,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:06:11,229 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:06:11,229 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:06:11,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:06:11,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:06:11,230 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer 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 -> Automizer 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-11-20 01:06:11,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:06:11,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:06:11,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:06:11,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:06:11,624 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:06:11,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-20 01:06:11,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/b9888e40c/94e3ba8477d44104824c0c6487900d54/FLAGdc95398bb [2019-11-20 01:06:12,151 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:06:12,152 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2019-11-20 01:06:12,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/b9888e40c/94e3ba8477d44104824c0c6487900d54/FLAGdc95398bb [2019-11-20 01:06:12,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/data/b9888e40c/94e3ba8477d44104824c0c6487900d54 [2019-11-20 01:06:12,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:06:12,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:06:12,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:06:12,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:06:12,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:06:12,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:06:12" (1/1) ... [2019-11-20 01:06:12,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250310c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:12, skipping insertion in model container [2019-11-20 01:06:12,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:06:12" (1/1) ... [2019-11-20 01:06:12,477 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:06:12,503 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:06:12,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:06:12,813 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:06:12,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:06:13,047 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:06:13,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13 WrapperNode [2019-11-20 01:06:13,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:06:13,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:06:13,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:06:13,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:06:13,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:06:13,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:06:13,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:06:13,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:06:13,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... [2019-11-20 01:06:13,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:06:13,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:06:13,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:06:13,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:06:13,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:06:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 01:06:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 01:06:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:06:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 01:06:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:06:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:06:13,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:06:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:06:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:06:14,696 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:06:14,697 INFO L285 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-20 01:06:14,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:06:14 BoogieIcfgContainer [2019-11-20 01:06:14,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:06:14,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:06:14,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:06:14,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:06:14,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:06:12" (1/3) ... [2019-11-20 01:06:14,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55fc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:06:14, skipping insertion in model container [2019-11-20 01:06:14,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:06:13" (2/3) ... [2019-11-20 01:06:14,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55fc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:06:14, skipping insertion in model container [2019-11-20 01:06:14,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:06:14" (3/3) ... [2019-11-20 01:06:14,710 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2019-11-20 01:06:14,719 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:06:14,725 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:06:14,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:06:14,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:06:14,763 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:06:14,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:06:14,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:06:14,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:06:14,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:06:14,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:06:14,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:06:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-20 01:06:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:06:14,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:14,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:14,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-20 01:06:14,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:06:14,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681708112] [2019-11-20 01:06:14,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 01:06:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:14,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:06:14,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:06:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:15,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:06:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681708112] [2019-11-20 01:06:15,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:15,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:06:15,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292416355] [2019-11-20 01:06:15,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:06:15,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:06:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:06:15,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:06:15,043 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-20 01:06:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:15,082 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-20 01:06:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:06:15,083 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-20 01:06:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:15,112 INFO L225 Difference]: With dead ends: 102 [2019-11-20 01:06:15,113 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 01:06:15,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:06:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 01:06:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 01:06:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 01:06:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-20 01:06:15,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-20 01:06:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:15,168 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-20 01:06:15,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:06:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-20 01:06:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:06:15,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:15,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:15,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 01:06:15,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-20 01:06:15,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:06:15,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037527124] [2019-11-20 01:06:15,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 01:06:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:15,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:06:15,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:06:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:15,671 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:06:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:15,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037527124] [2019-11-20 01:06:15,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:15,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 01:06:15,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965521137] [2019-11-20 01:06:15,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:06:15,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:06:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:06:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:06:15,822 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-20 01:06:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:16,629 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-20 01:06:16,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:06:16,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-20 01:06:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:16,632 INFO L225 Difference]: With dead ends: 64 [2019-11-20 01:06:16,632 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 01:06:16,633 INFO L630 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-11-20 01:06:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 01:06:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 01:06:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:06:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-20 01:06:16,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-20 01:06:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:16,642 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-20 01:06:16,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:06:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-20 01:06:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 01:06:16,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:16,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:16,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 01:06:16,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-20 01:06:16,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:06:16,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229575198] [2019-11-20 01:06:16,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 01:06:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:17,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:06:17,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:06:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:17,511 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:06:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:17,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229575198] [2019-11-20 01:06:17,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:17,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 01:06:17,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891796716] [2019-11-20 01:06:17,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:06:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:06:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:06:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:06:17,517 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-20 01:06:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:17,543 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-20 01:06:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:06:17,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 01:06:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:17,545 INFO L225 Difference]: With dead ends: 30 [2019-11-20 01:06:17,546 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 01:06:17,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:06:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 01:06:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 01:06:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:06:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-20 01:06:17,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-20 01:06:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:17,554 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-20 01:06:17,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:06:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-20 01:06:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:06:17,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:17,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:17,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 01:06:17,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-20 01:06:17,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:06:17,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627554425] [2019-11-20 01:06:17,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 01:06:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:18,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:06:18,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:06:18,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-11-20 01:06:18,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:06:18,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:18,425 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:06:18,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:18,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:06:18,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-20 01:06:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:06:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,519 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:06:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:06:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627554425] [2019-11-20 01:06:18,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:18,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 01:06:18,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184475935] [2019-11-20 01:06:18,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:06:18,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:06:18,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:06:18,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:06:18,614 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-20 01:06:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:19,515 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-20 01:06:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:06:19,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-20 01:06:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:19,517 INFO L225 Difference]: With dead ends: 31 [2019-11-20 01:06:19,518 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 01:06:19,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:06:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 01:06:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 01:06:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:06:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-20 01:06:19,525 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-20 01:06:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:19,526 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-20 01:06:19,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:06:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-20 01:06:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:06:19,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:06:19,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:06:19,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 01:06:19,728 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:06:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:06:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-20 01:06:19,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:06:19,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975186919] [2019-11-20 01:06:19,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4e22ed-7869-4188-a5d8-c04afc6989e4/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 01:06:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:20,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 01:06:20,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:06:20,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 01:06:20,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:06:20,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:20,253 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:06:20,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:20,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:06:20,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:40 [2019-11-20 01:06:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:06:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:20,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:06:20,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:06:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:06:20,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2019-11-20 01:06:20,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:06:20,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:20,948 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:06:20,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:06:20,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:06:20,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:36 [2019-11-20 01:06:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:21,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975186919] [2019-11-20 01:06:21,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:06:21,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-20 01:06:21,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754668002] [2019-11-20 01:06:21,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:06:21,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:06:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:06:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:06:21,140 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-20 01:06:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:06:23,426 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-20 01:06:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:06:23,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-20 01:06:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:06:23,426 INFO L225 Difference]: With dead ends: 27 [2019-11-20 01:06:23,427 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:06:23,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:06:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:06:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:06:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:06:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:06:23,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-20 01:06:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:06:23,429 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:06:23,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:06:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:06:23,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:06:23,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 01:06:23,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:06:23,900 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-20 01:06:24,049 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-20 01:06:24,254 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-20 01:06:24,409 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-20 01:06:24,523 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-20 01:06:24,523 INFO L440 ceAbstractionStarter]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-20 01:06:24,523 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-20 01:06:24,524 INFO L440 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (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-11-20 01:06:24,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:06:24,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:06:24,524 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-20 01:06:24,524 INFO L440 ceAbstractionStarter]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-20 01:06:24,524 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-20 01:06:24,525 INFO L440 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (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-11-20 01:06:24,525 INFO L444 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-20 01:06:24,525 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-20 01:06:24,525 INFO L447 ceAbstractionStarter]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-20 01:06:24,525 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-20 01:06:24,526 INFO L440 ceAbstractionStarter]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64))) (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-11-20 01:06:24,526 INFO L444 ceAbstractionStarter]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-20 01:06:24,526 INFO L440 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-11-20 01:06:24,526 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-20 01:06:24,527 INFO L440 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-11-20 01:06:24,527 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-20 01:06:24,527 INFO L440 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-11-20 01:06:24,528 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-20 01:06:24,528 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 01:06:24,528 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-20 01:06:24,528 INFO L440 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-20 01:06:24,528 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-20 01:06:24,529 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-20 01:06:24,529 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-20 01:06:24,529 INFO L440 ceAbstractionStarter]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-20 01:06:24,529 INFO L444 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-20 01:06:24,530 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-20 01:06:24,530 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-20 01:06:24,530 INFO L444 ceAbstractionStarter]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-20 01:06:24,530 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-20 01:06:24,530 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-20 01:06:24,531 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-20 01:06:24,531 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-20 01:06:24,531 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-20 01:06:24,531 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-20 01:06:24,531 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-20 01:06:24,532 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:06:24,532 INFO L444 ceAbstractionStarter]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-20 01:06:24,532 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-20 01:06:24,532 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-20 01:06:24,532 INFO L444 ceAbstractionStarter]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-20 01:06:24,533 INFO L444 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-20 01:06:24,533 INFO L444 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-20 01:06:24,533 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-20 01:06:24,533 INFO L444 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-20 01:06:24,533 INFO L444 ceAbstractionStarter]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-20 01:06:24,534 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 01:06:24,534 INFO L440 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-11-20 01:06:24,539 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:06:24,544 INFO L168 Benchmark]: Toolchain (without parser) took 12085.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,545 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:06:24,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.28 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,547 INFO L168 Benchmark]: Boogie Preprocessor took 74.09 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,548 INFO L168 Benchmark]: RCFGBuilder took 1484.82 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,549 INFO L168 Benchmark]: TraceAbstraction took 9841.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:06:24,553 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.28 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.09 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1484.82 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9841.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.3 MB). Peak memory consumption was 29.8 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...