./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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 bf0ba25fe26682d00fcbd742510a570b9ca53290 ................................................................................................................................................................................................................................................................................................................ 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_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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 bf0ba25fe26682d00fcbd742510a570b9ca53290 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 11:24:35,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:24:35,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:24:35,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:24:35,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:24:35,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:24:35,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:24:35,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:24:35,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:24:35,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:24:35,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:24:35,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:24:35,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:24:35,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:24:35,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:24:35,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:24:35,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:24:35,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:24:35,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:24:35,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:24:35,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:24:35,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:24:35,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:24:35,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:24:35,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:24:35,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:24:35,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:24:35,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:24:35,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:24:35,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:24:35,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:24:35,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:24:35,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:24:35,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:24:35,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:24:35,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:24:35,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:24:35,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:24:35,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:24:35,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:24:35,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:24:35,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:24:35,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:24:35,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:24:35,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:24:35,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:24:35,442 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:24:35,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:24:35,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:24:35,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:24:35,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:24:35,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:24:35,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:24:35,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:24:35,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:24:35,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:24:35,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:24:35,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:24:35,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:24:35,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:24:35,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:24:35,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:24:35,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:24:35,445 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_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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 -> bf0ba25fe26682d00fcbd742510a570b9ca53290 [2019-12-07 11:24:35,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:24:35,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:24:35,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:24:35,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:24:35,554 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:24:35,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-12-07 11:24:35,590 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/010365c5f/ed0af59a1d864444b3c1c04953034f2c/FLAGeb5e2a6b9 [2019-12-07 11:24:36,069 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:24:36,069 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-12-07 11:24:36,075 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/010365c5f/ed0af59a1d864444b3c1c04953034f2c/FLAGeb5e2a6b9 [2019-12-07 11:24:36,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/010365c5f/ed0af59a1d864444b3c1c04953034f2c [2019-12-07 11:24:36,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:24:36,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:24:36,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:36,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:24:36,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:24:36,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f07a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36, skipping insertion in model container [2019-12-07 11:24:36,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:24:36,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:24:36,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:36,281 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:24:36,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:36,332 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:24:36,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36 WrapperNode [2019-12-07 11:24:36,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:36,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:36,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:24:36,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:24:36,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:36,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:24:36,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:24:36,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:24:36,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... [2019-12-07 11:24:36,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:24:36,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:24:36,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:24:36,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:24:36,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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-12-07 11:24:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:24:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:24:36,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-12-07 11:24:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:24:36,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:24:36,645 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 11:24:36,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:36 BoogieIcfgContainer [2019-12-07 11:24:36,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:24:36,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:24:36,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:24:36,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:24:36,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:24:36" (1/3) ... [2019-12-07 11:24:36,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414e19ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:36, skipping insertion in model container [2019-12-07 11:24:36,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:36" (2/3) ... [2019-12-07 11:24:36,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414e19ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:36, skipping insertion in model container [2019-12-07 11:24:36,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:36" (3/3) ... [2019-12-07 11:24:36,652 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2019-12-07 11:24:36,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:24:36,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:24:36,669 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:24:36,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:24:36,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:24:36,684 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:24:36,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:24:36,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:24:36,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:24:36,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:24:36,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:24:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-12-07 11:24:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:24:36,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:36,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:36,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-12-07 11:24:36,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:36,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305572721] [2019-12-07 11:24:36,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:36,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305572721] [2019-12-07 11:24:36,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:36,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:24:36,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897936377] [2019-12-07 11:24:36,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:24:36,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:36,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:24:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:24:36,815 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-12-07 11:24:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:36,827 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-12-07 11:24:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:24:36,828 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 11:24:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:36,834 INFO L225 Difference]: With dead ends: 66 [2019-12-07 11:24:36,835 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:24:36,837 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-12-07 11:24:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:24:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 11:24:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:24:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-12-07 11:24:36,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-12-07 11:24:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:36,859 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-12-07 11:24:36,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:24:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-12-07 11:24:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:24:36,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:36,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:36,860 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:36,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-12-07 11:24:36,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:36,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21776228] [2019-12-07 11:24:36,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:24:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:24:36,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:24:36,952 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:24:36,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:24:36 BoogieIcfgContainer [2019-12-07 11:24:36,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:24:36,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:24:36,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:24:36,977 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:24:36,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:36" (3/4) ... [2019-12-07 11:24:36,980 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:24:36,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:24:36,981 INFO L168 Benchmark]: Toolchain (without parser) took 892.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.3 MB in the beginning and 1.0 GB in the end (delta: -80.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:36,982 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:36,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:36,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:36,983 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:36,983 INFO L168 Benchmark]: RCFGBuilder took 253.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:36,983 INFO L168 Benchmark]: TraceAbstraction took 329.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:24:36,984 INFO L168 Benchmark]: Witness Printer took 2.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:24:36,986 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 329.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 145]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of bitwiseAnd at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L141] double x = -1.0 / 0.0; [L65] double w, s1, s2, z; [L66] __int32_t ix, hx, id; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L69] ieee_double_shape_type gh_u; [L70] gh_u.value = (x) [L71] EXPR gh_u.parts.msw [L71] (hx) = gh_u.parts.msw [L73] ix = hx & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L74] COND TRUE ix >= 0x44100000 [L75] __uint32_t low; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L77] ieee_double_shape_type gl_u; [L78] gl_u.value = (x) [L79] EXPR gl_u.parts.lsw [L79] (low) = gl_u.parts.lsw [L81] COND TRUE ix > 0x7ff00000 || (ix == 0x7ff00000 && (low != 0)) [L82] return x + x; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L142] double res = atan_double(x); [L144] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L145] __VERIFIER_error() VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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.25-f470102 [2019-12-07 11:24:38,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:24:38,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:24:38,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:24:38,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:24:38,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:24:38,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:24:38,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:24:38,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:24:38,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:24:38,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:24:38,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:24:38,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:24:38,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:24:38,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:24:38,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:24:38,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:24:38,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:24:38,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:24:38,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:24:38,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:24:38,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:24:38,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:24:38,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:24:38,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:24:38,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:24:38,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:24:38,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:24:38,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:24:38,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:24:38,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:24:38,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:24:38,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:24:38,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:24:38,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:24:38,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:24:38,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:24:38,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:24:38,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:24:38,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:24:38,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:24:38,414 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 11:24:38,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:24:38,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:24:38,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:24:38,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:24:38,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:24:38,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:24:38,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:24:38,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:24:38,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:24:38,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:24:38,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:24:38,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:24:38,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:24:38,430 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:24:38,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:24:38,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:24:38,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:24:38,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:24:38,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:24:38,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:24:38,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:24:38,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:24:38,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:24:38,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:24:38,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:24:38,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:24:38,434 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_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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 -> bf0ba25fe26682d00fcbd742510a570b9ca53290 [2019-12-07 11:24:38,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:24:38,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:24:38,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:24:38,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:24:38,626 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:24:38,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-12-07 11:24:38,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/e88b50010/51a55c6258464f64bab658de10c54fe9/FLAGfddc100eb [2019-12-07 11:24:39,019 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:24:39,019 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-12-07 11:24:39,024 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/e88b50010/51a55c6258464f64bab658de10c54fe9/FLAGfddc100eb [2019-12-07 11:24:39,033 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/bin/uautomizer/data/e88b50010/51a55c6258464f64bab658de10c54fe9 [2019-12-07 11:24:39,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:24:39,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:24:39,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:39,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:24:39,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:24:39,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b30e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39, skipping insertion in model container [2019-12-07 11:24:39,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:24:39,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:24:39,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:39,194 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:24:39,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:24:39,285 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:24:39,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39 WrapperNode [2019-12-07 11:24:39,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:24:39,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:39,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:24:39,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:24:39,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:24:39,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:24:39,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:24:39,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:24:39,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... [2019-12-07 11:24:39,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:24:39,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:24:39,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:24:39,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:24:39,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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-12-07 11:24:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-12-07 11:24:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-12-07 11:24:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:24:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-12-07 11:24:39,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:24:39,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:24:39,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:24:39,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 11:24:39,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:24:55,916 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:24:55,916 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 11:24:55,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:55 BoogieIcfgContainer [2019-12-07 11:24:55,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:24:55,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:24:55,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:24:55,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:24:55,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:24:39" (1/3) ... [2019-12-07 11:24:55,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54042c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:55, skipping insertion in model container [2019-12-07 11:24:55,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:24:39" (2/3) ... [2019-12-07 11:24:55,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54042c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:24:55, skipping insertion in model container [2019-12-07 11:24:55,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:24:55" (3/3) ... [2019-12-07 11:24:55,923 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2019-12-07 11:24:55,930 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:24:55,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:24:55,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:24:55,958 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:24:55,958 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:24:55,959 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:24:55,959 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:24:55,959 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:24:55,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:24:55,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:24:55,959 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:24:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-12-07 11:24:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:24:55,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:55,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:55,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-12-07 11:24:55,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:24:55,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982458515] [2019-12-07 11:24:55,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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-12-07 11:24:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:56,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 11:24:56,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:56,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:24:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:56,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982458515] [2019-12-07 11:24:56,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:56,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:24:56,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504917518] [2019-12-07 11:24:56,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:24:56,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:24:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:24:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:24:56,308 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-12-07 11:24:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:56,320 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-12-07 11:24:56,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:24:56,321 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 11:24:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:56,328 INFO L225 Difference]: With dead ends: 66 [2019-12-07 11:24:56,328 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:24:56,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:24:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:24:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 11:24:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:24:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-12-07 11:24:56,354 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-12-07 11:24:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:56,354 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-12-07 11:24:56,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:24:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-12-07 11:24:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:24:56,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:56,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:56,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:24:56,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-12-07 11:24:56,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:24:56,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408208000] [2019-12-07 11:24:56,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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-12-07 11:24:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:57,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:24:57,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:57,168 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 15 treesize of output 13 [2019-12-07 11:24:57,180 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:57,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:57,184 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:57,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:57,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:57,208 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2019-12-07 11:24:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:57,256 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:24:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:57,299 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 15 treesize of output 13 [2019-12-07 11:24:57,304 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:57,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:57,306 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:57,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:57,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 11:24:57,332 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2019-12-07 11:24:57,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:24:57,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408208000] [2019-12-07 11:24:57,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:57,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 11:24:57,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136638488] [2019-12-07 11:24:57,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:24:57,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:24:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:24:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:24:57,500 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 10 states. [2019-12-07 11:24:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:57,906 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-12-07 11:24:57,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:24:57,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 11:24:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:57,915 INFO L225 Difference]: With dead ends: 35 [2019-12-07 11:24:57,915 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 11:24:57,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:24:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 11:24:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 11:24:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 11:24:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-12-07 11:24:57,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2019-12-07 11:24:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:57,919 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-12-07 11:24:57,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:24:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-12-07 11:24:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:24:57,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:57,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:58,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:24:58,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1317299133, now seen corresponding path program 1 times [2019-12-07 11:24:58,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:24:58,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146867386] [2019-12-07 11:24:58,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ebea6c7-2be1-4532-9d18-ba2d59fcf0f2/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-12-07 11:24:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:58,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 11:24:58,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:58,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:58,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:58,785 INFO L343 Elim1Store]: treesize reduction 57, result has 43.6 percent of original size [2019-12-07 11:24:58,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2019-12-07 11:24:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:58,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:58,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:59,100 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 11:24:59,101 INFO L614 ElimStorePlain]: treesize reduction 83, result has 63.3 percent of original size [2019-12-07 11:24:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:24:59,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:59,104 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:145, output treesize:143 [2019-12-07 11:24:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:24:59,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:24:59,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:24:59,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:59,600 INFO L237 Elim1Store]: Index analysis took 323 ms [2019-12-07 11:24:59,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:59,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 105 [2019-12-07 11:24:59,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:59,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:00,072 INFO L237 Elim1Store]: Index analysis took 266 ms [2019-12-07 11:25:00,270 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-07 11:25:00,271 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-12-07 11:25:00,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 135 [2019-12-07 11:25:00,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:00,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:00,405 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-12-07 11:25:00,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:00,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 105 [2019-12-07 11:25:00,485 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:00,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:00,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:00,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2019-12-07 11:25:00,644 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:03,537 WARN L192 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-12-07 11:25:03,538 INFO L614 ElimStorePlain]: treesize reduction 166, result has 80.9 percent of original size [2019-12-07 11:25:03,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,796 INFO L237 Elim1Store]: Index analysis took 239 ms [2019-12-07 11:25:03,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:03,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:03,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 11:25:03,950 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:03,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:03,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,262 INFO L237 Elim1Store]: Index analysis took 278 ms [2019-12-07 11:25:04,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:04,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:04,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 11:25:04,475 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:04,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,780 INFO L237 Elim1Store]: Index analysis took 282 ms [2019-12-07 11:25:04,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:04,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:04,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 11:25:04,968 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:04,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:04,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:05,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:05,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:05,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:05,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:05,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:05,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 88 [2019-12-07 11:25:05,069 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:06,638 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2019-12-07 11:25:06,639 INFO L614 ElimStorePlain]: treesize reduction 85, result has 88.3 percent of original size [2019-12-07 11:25:06,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:06,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 4 xjuncts. [2019-12-07 11:25:06,642 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:686, output treesize:640 [2019-12-07 11:25:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:06,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:06,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:06,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,217 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-12-07 11:25:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:25:07,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:07,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:09,191 INFO L237 Elim1Store]: Index analysis took 1489 ms [2019-12-07 11:25:09,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:09,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 113 [2019-12-07 11:25:09,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:09,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:09,906 INFO L237 Elim1Store]: Index analysis took 601 ms [2019-12-07 11:25:09,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:09,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 70 [2019-12-07 11:25:09,959 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:10,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:10,521 INFO L237 Elim1Store]: Index analysis took 516 ms [2019-12-07 11:25:10,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:10,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 68 [2019-12-07 11:25:10,559 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:10,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:10,753 INFO L237 Elim1Store]: Index analysis took 149 ms [2019-12-07 11:25:10,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:10,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 70 [2019-12-07 11:25:10,798 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:14,115 WARN L192 SmtUtils]: Spent 3.32 s on a formula simplification that was a NOOP. DAG size: 288 [2019-12-07 11:25:14,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:14,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:14,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:14,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:14,750 INFO L237 Elim1Store]: Index analysis took 589 ms [2019-12-07 11:25:14,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:14,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:14,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:15,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:15,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 11:25:15,036 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:15,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:15,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:15,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:15,612 INFO L237 Elim1Store]: Index analysis took 551 ms [2019-12-07 11:25:15,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:15,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:15,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:15,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:15,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 11:25:15,980 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:16,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,373 INFO L237 Elim1Store]: Index analysis took 355 ms [2019-12-07 11:25:16,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,563 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:16,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:16,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 11:25:16,607 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:16,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:16,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:25:16,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:16,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 144 [2019-12-07 11:25:16,795 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:19,595 WARN L192 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 328 DAG size of output: 294 [2019-12-07 11:25:19,596 INFO L614 ElimStorePlain]: treesize reduction 160, result has 82.0 percent of original size [2019-12-07 11:25:19,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 35 dim-0 vars, and 4 xjuncts. [2019-12-07 11:25:19,609 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:762, output treesize:727 [2019-12-07 11:25:19,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:19,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:22,553 WARN L192 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 118 [2019-12-07 11:25:22,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:22,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:27,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:25:27,587 INFO L237 Elim1Store]: Index analysis took 244 ms [2019-12-07 11:25:27,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:27,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 68 [2019-12-07 11:25:27,594 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:25:28,270 INFO L237 Elim1Store]: Index analysis took 291 ms [2019-12-07 11:25:28,314 INFO L343 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2019-12-07 11:25:28,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 12 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 166 treesize of output 92 [2019-12-07 11:25:28,315 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:25:32,417 WARN L192 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-12-07 11:25:32,418 INFO L614 ElimStorePlain]: treesize reduction 160, result has 41.8 percent of original size [2019-12-07 11:25:32,422 INFO L534 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 11:25:32,423 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:469, output treesize:68 [2019-12-07 11:25:33,210 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 11:25:34,336 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 11:25:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:34,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:36,552 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 11:25:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:43,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146867386] [2019-12-07 11:25:43,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:43,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 11:25:43,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278412545] [2019-12-07 11:25:43,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:25:43,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:43,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:25:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=95, Unknown=5, NotChecked=0, Total=132 [2019-12-07 11:25:43,152 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 12 states. [2019-12-07 11:25:57,751 WARN L192 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 338 DAG size of output: 337 [2019-12-07 11:26:09,640 WARN L192 SmtUtils]: Spent 11.37 s on a formula simplification. DAG size of input: 342 DAG size of output: 341 [2019-12-07 11:26:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:09,642 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-12-07 11:26:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:09,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 11:26:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:09,643 INFO L225 Difference]: With dead ends: 14 [2019-12-07 11:26:09,643 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:26:09,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=55, Invalid=122, Unknown=5, NotChecked=0, Total=182 [2019-12-07 11:26:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:26:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:26:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:26:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:26:09,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-12-07 11:26:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:09,644 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:26:09,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:26:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:26:09,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:26:09,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:26:09,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:26:12,602 WARN L192 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 368 [2019-12-07 11:26:13,306 WARN L192 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 341 [2019-12-07 11:26:13,409 INFO L246 CegarLoopResult]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-12-07 11:26:13,409 INFO L246 CegarLoopResult]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-12-07 11:26:13,409 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L242 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L144(lines 144 147) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L242 CegarLoopResult]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-12-07 11:26:13,410 INFO L246 CegarLoopResult]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-12-07 11:26:13,411 INFO L242 CegarLoopResult]: At program point L130-3(lines 64 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64)) (v_skolemized_v_prenex_20_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse0 (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (and (= ((_ extract 31 0) v_skolemized_v_prenex_20_3) ULTIMATE.start_atan_double_~low~0) (= .cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_20_3) ((_ extract 62 52) v_skolemized_v_prenex_20_3) ((_ extract 51 0) v_skolemized_v_prenex_20_3))) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0) (= .cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (v_arrayElimCell_92 (_ BitVec 32)) (v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (fp.sub roundNearestTiesToEven (fp.neg (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_3) ((_ extract 31 0) v_skolemized_v_prenex_1_3)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_12_3) v_arrayElimCell_92))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) |ULTIMATE.start_atan_double_#res|) (= (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)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x)) (let ((.cse10 (select |#valid| (_ bv0 32))) (.cse3 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse5 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse13 (= |~#atanlo_atan~0.base| (_ bv0 32))) (.cse8 (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|))) (.cse9 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse3 (exists ((v_prenex_24 (_ BitVec 64))) (let ((.cse4 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_24)) (= (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_24)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24)))))) .cse5 (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_23 (_ BitVec 64))) (let ((.cse6 (= |~#atanlo_atan~0.base| v_prenex_26)) (.cse7 (select |#memory_int| v_prenex_26))) (and (not .cse6) (or .cse6 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|))) (= (select .cse7 (_ bv4 32)) ((_ extract 63 32) v_prenex_23)) (= (_ bv0 1) (select |#valid| v_prenex_26)) (= (select .cse7 (_ bv0 32)) ((_ extract 31 0) v_prenex_23))))) .cse8 (exists ((v_prenex_28 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_28)) (= (fp ((_ extract 63 63) v_prenex_28) ((_ extract 62 52) v_prenex_28) ((_ extract 51 0) v_prenex_28)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (exists ((v_prenex_27 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32))) ((_ extract 31 0) v_prenex_27)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27))))) (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_29 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_29) ((_ extract 62 52) v_prenex_29) ((_ extract 51 0) v_prenex_29))) (= (select (select |#memory_int| v_prenex_25) (_ bv8 32)) ((_ extract 31 0) v_prenex_29)) (= (_ bv1 1) (select |#valid| v_prenex_25)) (not (= |~#atanlo_atan~0.base| v_prenex_25)))) .cse9 (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and (= (_ bv1 1) .cse10) .cse3 (exists ((v_prenex_30 (_ BitVec 64)) (v_prenex_32 (_ BitVec 32))) (let ((.cse11 (select |#memory_int| v_prenex_32)) (.cse12 (= |~#atanlo_atan~0.base| v_prenex_32))) (and (= ((_ extract 63 32) v_prenex_30) (select .cse11 (_ bv4 32))) (= (_ bv0 1) (select |#valid| v_prenex_32)) (= ((_ extract 31 0) v_prenex_30) (select .cse11 (_ bv0 32))) (not .cse12) (or .cse12 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)))))) .cse5 (exists ((v_prenex_35 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_35) ((_ extract 62 52) v_prenex_35) ((_ extract 51 0) v_prenex_35))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv8 32)) ((_ extract 31 0) v_prenex_35)))) .cse8 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_33) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (not .cse13) .cse9 (exists ((v_prenex_31 (_ BitVec 64))) (let ((.cse14 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_31) (select .cse14 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_31) (select .cse14 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_31) ((_ extract 62 52) v_prenex_31) ((_ extract 51 0) v_prenex_31)))))) (exists ((v_prenex_34 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_34) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))))))) (and .cse3 (exists ((v_prenex_38 (_ BitVec 64))) (and (= (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32))) ((_ extract 31 0) v_prenex_38)) (= (fp ((_ extract 63 63) v_prenex_38) ((_ extract 62 52) v_prenex_38) ((_ extract 51 0) v_prenex_38)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))))) .cse5 (= (_ bv0 1) .cse10) .cse8 (exists ((v_prenex_40 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64))) (let ((.cse15 (= |~#atanlo_atan~0.base| v_prenex_40)) (.cse16 (select |#memory_int| v_prenex_40))) (and (not .cse15) (= (select .cse16 (_ bv4 32)) ((_ extract 63 32) v_prenex_36)) (or (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)) .cse15) (= ((_ extract 31 0) v_prenex_36) (select .cse16 (_ bv0 32))) (= (select |#valid| v_prenex_40) (_ bv0 1))))) (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse17 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= (select .cse17 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_37)) (= (select .cse17 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_37))))) (exists ((v_prenex_41 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_41) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))))) (exists ((v_prenex_39 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64))) (and (not (= |~#atanlo_atan~0.base| v_prenex_39)) (= ((_ extract 31 0) v_prenex_42) (select (select |#memory_int| v_prenex_39) (_ bv8 32))) (= (_ bv1 1) (select |#valid| v_prenex_39)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))))) .cse9) (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3))))) .cse3 (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (= (_ bv1 1) (select |#valid| |~#aT_atan~0.base|)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))))) .cse5 .cse13 .cse8 (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32))) (let ((.cse18 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse19 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse18) (or .cse18 (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|))) (= (select .cse19 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (select .cse19 (_ bv4 32)))))) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse9 (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse20 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (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))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse20 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse20 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))))))))))) [2019-12-07 11:26:13,411 INFO L246 CegarLoopResult]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-12-07 11:26:13,411 INFO L246 CegarLoopResult]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-12-07 11:26:13,411 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:26:13,411 INFO L246 CegarLoopResult]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L249 CegarLoopResult]: At program point L148(lines 134 149) the Hoare annotation is: true [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-12-07 11:26:13,412 INFO L246 CegarLoopResult]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-12-07 11:26:13,413 INFO L242 CegarLoopResult]: At program point L76-2(lines 76 80) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (let ((.cse5 (select |#valid| (_ bv0 32))) (.cse2 (= |~#atanhi_atan~0.offset| (_ bv0 32))) (.cse3 (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1))) (.cse14 (= |~#atanlo_atan~0.base| (_ bv0 32))) (.cse6 (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|))) (.cse7 (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0)) (.cse8 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((v_prenex_40 (_ BitVec 32)) (v_prenex_36 (_ BitVec 64))) (let ((.cse0 (= v_prenex_40 |~#atanlo_atan~0.base|)) (.cse1 (select |#memory_int| v_prenex_40))) (and (not .cse0) (= ((_ extract 63 32) v_prenex_36) (select .cse1 (_ bv4 32))) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse0) (= (select |#valid| v_prenex_40) (_ bv0 1)) (= (select .cse1 (_ bv0 32)) ((_ extract 31 0) v_prenex_36))))) .cse2 .cse3 (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse4 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= ((_ extract 31 0) v_prenex_37) (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_37) (select .cse4 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))))))) (= (_ bv0 1) .cse5) (exists ((v_prenex_38 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_38) ((_ extract 62 52) v_prenex_38) ((_ extract 51 0) v_prenex_38)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_38) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse6 (exists ((v_prenex_39 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64))) (and (not (= v_prenex_39 |~#atanlo_atan~0.base|)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))) (= (select (select |#memory_int| v_prenex_39) (_ bv8 32)) ((_ extract 31 0) v_prenex_42)) (= (bvadd (select |#valid| v_prenex_39) (_ bv1 1)) (_ bv0 1)))) (exists ((v_prenex_41 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_41) ((_ extract 62 52) v_prenex_41) ((_ extract 51 0) v_prenex_41)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_41) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))))) .cse7 .cse8) (and (exists ((v_prenex_25 (_ BitVec 32)) (v_prenex_29 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_29) ((_ extract 62 52) v_prenex_29) ((_ extract 51 0) v_prenex_29))) (= (select (select |#memory_int| v_prenex_25) (_ bv8 32)) ((_ extract 31 0) v_prenex_29)) (= (bvadd (select |#valid| v_prenex_25) (_ bv1 1)) (_ bv0 1)) (not (= v_prenex_25 |~#atanlo_atan~0.base|)))) .cse2 (exists ((v_prenex_27 (_ BitVec 64))) (and (= ((_ extract 31 0) v_prenex_27) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_27) ((_ extract 62 52) v_prenex_27) ((_ extract 51 0) v_prenex_27))))) (exists ((v_prenex_24 (_ BitVec 64))) (let ((.cse9 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_prenex_24) (select .cse9 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_prenex_24) (select .cse9 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24)))))) .cse3 (exists ((v_prenex_26 (_ BitVec 32)) (v_prenex_23 (_ BitVec 64))) (let ((.cse10 (= v_prenex_26 |~#atanlo_atan~0.base|)) (.cse11 (select |#memory_int| v_prenex_26))) (and (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse10) (= ((_ extract 63 32) v_prenex_23) (select .cse11 (_ bv4 32))) (not .cse10) (= (select |#valid| v_prenex_26) (_ bv0 1)) (= (select .cse11 (_ bv0 32)) ((_ extract 31 0) v_prenex_23))))) .cse6 (exists ((v_prenex_28 (_ BitVec 64))) (and (= ((_ extract 63 32) v_prenex_28) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= (fp ((_ extract 63 63) v_prenex_28) ((_ extract 62 52) v_prenex_28) ((_ extract 51 0) v_prenex_28)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) .cse7 .cse8 (= (_ bv0 32) |~#atanhi_atan~0.base|)) (and (= (_ bv1 1) .cse5) .cse2 (exists ((v_prenex_30 (_ BitVec 64)) (v_prenex_32 (_ BitVec 32))) (let ((.cse12 (= v_prenex_32 |~#atanlo_atan~0.base|)) (.cse13 (select |#memory_int| v_prenex_32))) (and (not .cse12) (= (select |#valid| v_prenex_32) (_ bv0 1)) (= (select .cse13 (_ bv0 32)) ((_ extract 31 0) v_prenex_30)) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse12) (= ((_ extract 63 32) v_prenex_30) (select .cse13 (_ bv4 32)))))) .cse3 (exists ((v_prenex_35 (_ BitVec 64))) (and (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_35) ((_ extract 62 52) v_prenex_35) ((_ extract 51 0) v_prenex_35))) (= (select (select |#memory_int| (_ bv0 32)) (_ bv8 32)) ((_ extract 31 0) v_prenex_35)))) .cse6 (exists ((v_prenex_33 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_33) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (not .cse14) .cse7 .cse8 (exists ((v_prenex_31 (_ BitVec 64))) (let ((.cse15 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 31 0) v_prenex_31) (select .cse15 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_prenex_31) (select .cse15 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_31) ((_ extract 62 52) v_prenex_31) ((_ extract 51 0) v_prenex_31)))))) (exists ((v_prenex_34 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_34) ((_ extract 62 52) v_prenex_34) ((_ extract 51 0) v_prenex_34)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= ((_ extract 63 32) v_prenex_34) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))))))) (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3))))) (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) .cse2 .cse3 .cse14 .cse6 (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) .cse7 .cse8 (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32))) (let ((.cse16 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse17 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse16) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse16) (= (select .cse17 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (select .cse17 (_ bv4 32)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse18 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (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))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse18 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))))))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x))) [2019-12-07 11:26:13,413 INFO L246 CegarLoopResult]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-12-07 11:26:13,413 INFO L246 CegarLoopResult]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-12-07 11:26:13,413 INFO L242 CegarLoopResult]: At program point L68-2(lines 68 72) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)) (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3))))) (= |~#atanhi_atan~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) ULTIMATE.start_atan_double_~x)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((|~#aT_atan~0.base| (_ BitVec 32)) (v_skolemized_v_prenex_14_3 (_ BitVec 64))) (and (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#atanlo_atan~0.base| (_ bv0 32)) (= (_ bv0 32) |~#atanhi_atan~0.base|) (= |~#aT_atan~0.base| (_ bv0 32))) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (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))) (= ((_ extract 31 0) v_skolemized_v_prenex_1_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))))))) [2019-12-07 11:26:13,418 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: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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 11:26:13,420 INFO L168 Benchmark]: Toolchain (without parser) took 94384.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:13,420 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:13,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:13,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.88 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:13,421 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 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-12-07 11:26:13,421 INFO L168 Benchmark]: RCFGBuilder took 16568.40 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.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:13,422 INFO L168 Benchmark]: TraceAbstraction took 77500.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:13,424 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.88 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.39 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 16568.40 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.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77500.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - 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. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...