./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/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 0cca6d33f0772631e27f925c9516a89b4af2326a ........................................................................................................................................................................................................................................................................................................................ 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_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/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 0cca6d33f0772631e27f925c9516a89b4af2326a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:05:46,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:05:46,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:05:46,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:05:46,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:05:46,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:05:46,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:05:46,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:05:46,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:05:46,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:05:46,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:05:46,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:05:46,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:05:46,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:05:46,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:05:46,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:05:46,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:05:46,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:05:46,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:05:46,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:05:46,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:05:46,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:05:46,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:05:46,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:05:46,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:05:46,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:05:46,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:05:46,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:05:46,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:05:46,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:05:46,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:05:46,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:05:46,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:05:46,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:05:46,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:05:46,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:05:46,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:05:46,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:05:46,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:05:46,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:05:46,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:05:46,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:05:47,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:05:47,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:05:47,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:05:47,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:05:47,024 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:05:47,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:05:47,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:05:47,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:05:47,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:05:47,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:05:47,026 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:05:47,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:05:47,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:05:47,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:05:47,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:05:47,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:05:47,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:05:47,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:05:47,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:05:47,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:05:47,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:05:47,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:05:47,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:05:47,028 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_10301c60-9b5b-4d56-8577-416370a4229b/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 -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2019-11-20 00:05:47,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:05:47,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:05:47,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:05:47,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:05:47,181 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:05:47,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-20 00:05:47,237 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/da50b71b7/31ff707d8d8e4686b1478084ab5c98a7/FLAGcacbb5261 [2019-11-20 00:05:47,663 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:05:47,664 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-20 00:05:47,671 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/da50b71b7/31ff707d8d8e4686b1478084ab5c98a7/FLAGcacbb5261 [2019-11-20 00:05:47,691 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/da50b71b7/31ff707d8d8e4686b1478084ab5c98a7 [2019-11-20 00:05:47,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:05:47,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:05:47,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:05:47,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:05:47,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:05:47,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:47" (1/1) ... [2019-11-20 00:05:47,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0d11d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:47, skipping insertion in model container [2019-11-20 00:05:47,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:47" (1/1) ... [2019-11-20 00:05:47,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:05:47,731 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:05:47,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:05:47,989 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:05:48,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:05:48,060 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:05:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48 WrapperNode [2019-11-20 00:05:48,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:05:48,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:05:48,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:05:48,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:05:48,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:05:48,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:05:48,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:05:48,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:05:48,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... [2019-11-20 00:05:48,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:05:48,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:05:48,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:05:48,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:05:48,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:05:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:05:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 00:05:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:05:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 00:05:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:05:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:05:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:05:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 00:05:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:05:49,091 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:05:49,091 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 00:05:49,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:05:49 BoogieIcfgContainer [2019-11-20 00:05:49,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:05:49,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:05:49,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:05:49,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:05:49,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:05:47" (1/3) ... [2019-11-20 00:05:49,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff5617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:05:49, skipping insertion in model container [2019-11-20 00:05:49,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:48" (2/3) ... [2019-11-20 00:05:49,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff5617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:05:49, skipping insertion in model container [2019-11-20 00:05:49,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:05:49" (3/3) ... [2019-11-20 00:05:49,102 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b.c [2019-11-20 00:05:49,111 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:05:49,117 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:05:49,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:05:49,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:05:49,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:05:49,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:05:49,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:05:49,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:05:49,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:05:49,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:05:49,150 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:05:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 00:05:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 00:05:49,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:49,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:05:49,173 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:05:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 00:05:49,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:05:49,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896670141] [2019-11-20 00:05:49,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:05:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:05:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:05:49,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896670141] [2019-11-20 00:05:49,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:05:49,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:05:49,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268423065] [2019-11-20 00:05:49,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:05:49,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:05:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:05:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:05:49,329 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 00:05:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:05:49,358 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 00:05:49,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:05:49,359 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 00:05:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:05:49,369 INFO L225 Difference]: With dead ends: 227 [2019-11-20 00:05:49,370 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 00:05:49,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:05:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 00:05:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 00:05:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 00:05:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 00:05:49,415 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 00:05:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:05:49,415 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 00:05:49,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:05:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 00:05:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:05:49,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:49,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:05:49,416 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:05:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 00:05:49,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:05:49,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021311009] [2019-11-20 00:05:49,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:05:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:05:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:05:49,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:05:49,626 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:05:49,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:05:49 BoogieIcfgContainer [2019-11-20 00:05:49,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:05:49,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:05:49,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:05:49,663 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:05:49,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:05:49" (3/4) ... [2019-11-20 00:05:49,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:05:49,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:05:49,669 INFO L168 Benchmark]: Toolchain (without parser) took 1973.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.1 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:05:49,670 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:05:49,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -214.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:05:49,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:05:49,672 INFO L168 Benchmark]: Boogie Preprocessor took 72.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:05:49,672 INFO L168 Benchmark]: RCFGBuilder took 885.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:05:49,673 INFO L168 Benchmark]: TraceAbstraction took 569.23 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:05:49,673 INFO L168 Benchmark]: Witness Printer took 4.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:05:49,676 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -214.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 885.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 569.23 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 260]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. 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; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = 0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y > 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] 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_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] 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_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L260] __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_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 164 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=115occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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.24-678e011 [2019-11-20 00:05:51,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:05:51,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:05:51,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:05:51,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:05:51,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:05:51,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:05:51,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:05:51,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:05:51,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:05:51,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:05:51,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:05:51,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:05:51,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:05:51,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:05:51,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:05:51,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:05:51,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:05:51,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:05:51,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:05:51,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:05:51,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:05:51,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:05:51,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:05:51,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:05:51,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:05:51,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:05:51,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:05:51,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:05:51,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:05:51,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:05:51,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:05:51,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:05:51,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:05:51,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:05:51,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:05:51,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:05:51,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:05:51,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:05:51,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:05:51,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:05:51,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 00:05:51,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:05:51,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:05:51,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:05:51,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:05:51,469 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:05:51,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:05:51,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:05:51,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:05:51,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:05:51,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:05:51,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:05:51,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:05:51,472 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:05:51,472 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:05:51,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:05:51,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:05:51,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:05:51,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:05:51,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:05:51,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:05:51,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:05:51,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:05:51,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:05:51,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:05:51,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:05:51,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:05:51,475 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:05:51,475 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:05:51,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:05:51,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:05:51,476 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_10301c60-9b5b-4d56-8577-416370a4229b/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 -> 0cca6d33f0772631e27f925c9516a89b4af2326a [2019-11-20 00:05:51,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:05:51,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:05:51,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:05:51,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:05:51,803 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:05:51,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-20 00:05:51,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/528aa35ef/36f8be5eceaa423c852576658da0c5c0/FLAGcbaaaebb0 [2019-11-20 00:05:52,220 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:05:52,221 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/sv-benchmarks/c/float-newlib/double_req_bl_0663b.c [2019-11-20 00:05:52,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/528aa35ef/36f8be5eceaa423c852576658da0c5c0/FLAGcbaaaebb0 [2019-11-20 00:05:52,582 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/data/528aa35ef/36f8be5eceaa423c852576658da0c5c0 [2019-11-20 00:05:52,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:05:52,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:05:52,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:05:52,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:05:52,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:05:52,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:52" (1/1) ... [2019-11-20 00:05:52,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d320ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:52, skipping insertion in model container [2019-11-20 00:05:52,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:05:52" (1/1) ... [2019-11-20 00:05:52,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:05:52,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:05:52,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:05:52,892 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:05:53,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:05:53,094 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:05:53,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53 WrapperNode [2019-11-20 00:05:53,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:05:53,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:05:53,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:05:53,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:05:53,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:05:53,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:05:53,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:05:53,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:05:53,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... [2019-11-20 00:05:53,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:05:53,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:05:53,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:05:53,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:05:53,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:05:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 00:05:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 00:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 00:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:05:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:05:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:05:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:05:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:06:31,598 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:06:31,598 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-20 00:06:31,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:31 BoogieIcfgContainer [2019-11-20 00:06:31,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:06:31,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:06:31,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:06:31,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:06:31,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:05:52" (1/3) ... [2019-11-20 00:06:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6271981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:31, skipping insertion in model container [2019-11-20 00:06:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:05:53" (2/3) ... [2019-11-20 00:06:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6271981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:31, skipping insertion in model container [2019-11-20 00:06:31,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:31" (3/3) ... [2019-11-20 00:06:31,606 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0663b.c [2019-11-20 00:06:31,615 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:06:31,623 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:06:31,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:06:31,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:06:31,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:06:31,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:06:31,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:06:31,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:06:31,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:06:31,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:06:31,655 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:06:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-20 00:06:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 00:06:31,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:06:31,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:06:31,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:06:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:06:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-20 00:06:31,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:06:31,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808264184] [2019-11-20 00:06:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 00:06:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:06:32,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 00:06:32,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:06:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:32,048 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:06:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:32,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808264184] [2019-11-20 00:06:32,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:06:32,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 00:06:32,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636558447] [2019-11-20 00:06:32,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:06:32,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:06:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:06:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:06:32,071 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-20 00:06:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:06:32,096 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-20 00:06:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:06:32,098 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 00:06:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:06:32,109 INFO L225 Difference]: With dead ends: 227 [2019-11-20 00:06:32,109 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 00:06:32,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:06:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 00:06:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 00:06:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 00:06:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-20 00:06:32,149 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-20 00:06:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:06:32,149 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-20 00:06:32,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:06:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-20 00:06:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:06:32,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:06:32,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:06:32,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 00:06:32,355 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:06:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:06:32,355 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-20 00:06:32,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:06:32,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137385267] [2019-11-20 00:06:32,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 00:06:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:06:32,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:06:32,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:06:32,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 00:06:32,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-20 00:06:32,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:32,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:32,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:32,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 00:06:32,999 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,003 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:33,030 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:33 [2019-11-20 00:06:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:33,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:06:33,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:33,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 61 [2019-11-20 00:06:33,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 41 [2019-11-20 00:06:33,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-20 00:06:33,601 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,620 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2019-11-20 00:06:33,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 00:06:33,667 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,685 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:06:33,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:33,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-20 00:06:33,728 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-20 00:06:33,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:34,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137385267] [2019-11-20 00:06:34,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:06:34,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 00:06:34,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798353381] [2019-11-20 00:06:34,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:06:34,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:06:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:06:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:06:34,202 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-20 00:06:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:06:36,491 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-20 00:06:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:06:36,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-20 00:06:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:06:36,856 INFO L225 Difference]: With dead ends: 167 [2019-11-20 00:06:36,857 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 00:06:36,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:06:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 00:06:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 00:06:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 00:06:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-11-20 00:06:36,869 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 13 [2019-11-20 00:06:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:06:36,869 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-11-20 00:06:36,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:06:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-11-20 00:06:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:06:36,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:06:36,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:06:37,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 00:06:37,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:06:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:06:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1228186055, now seen corresponding path program 1 times [2019-11-20 00:06:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:06:37,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097887424] [2019-11-20 00:06:37,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 00:06:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:06:37,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:06:37,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:06:37,771 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:38,042 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:38,297 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:38,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:06:40,064 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-20 00:06:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:40,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097887424] [2019-11-20 00:06:40,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:06:40,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 00:06:40,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237013322] [2019-11-20 00:06:40,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:06:40,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:06:40,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:06:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:06:40,069 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 10 states. [2019-11-20 00:06:40,395 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 00:06:40,875 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 00:06:41,861 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 00:06:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:06:43,089 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-11-20 00:06:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:06:43,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-20 00:06:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:06:43,095 INFO L225 Difference]: With dead ends: 72 [2019-11-20 00:06:43,095 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 00:06:43,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:06:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 00:06:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 00:06:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 00:06:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-11-20 00:06:43,106 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 18 [2019-11-20 00:06:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:06:43,106 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-11-20 00:06:43,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:06:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-11-20 00:06:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 00:06:43,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:06:43,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:06:43,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 00:06:43,308 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:06:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:06:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 50256570, now seen corresponding path program 1 times [2019-11-20 00:06:43,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:06:43,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993434641] [2019-11-20 00:06:43,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 00:06:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:06:43,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:06:43,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:06:43,839 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:44,103 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:44,426 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 00:06:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:44,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:06:46,849 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-20 00:06:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:46,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993434641] [2019-11-20 00:06:46,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:06:46,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 00:06:46,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897582541] [2019-11-20 00:06:46,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:06:46,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:06:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:06:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:06:46,853 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 10 states. [2019-11-20 00:06:47,237 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 00:06:47,819 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 00:06:48,161 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 00:06:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:06:48,935 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-20 00:06:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:06:48,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 00:06:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:06:48,942 INFO L225 Difference]: With dead ends: 70 [2019-11-20 00:06:48,942 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 00:06:48,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:06:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 00:06:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 00:06:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 00:06:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-20 00:06:48,950 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 20 [2019-11-20 00:06:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:06:48,951 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-20 00:06:48,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:06:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-20 00:06:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 00:06:48,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:06:48,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:06:49,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 00:06:49,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:06:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:06:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-20 00:06:49,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:06:49,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026911618] [2019-11-20 00:06:49,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 00:06:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:06:49,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:06:49,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:06:49,782 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 00:06:49,987 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 00:06:50,104 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 00:06:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:50,107 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:06:58,880 WARN L191 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-11-20 00:06:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:06:58,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026911618] [2019-11-20 00:06:58,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:06:58,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 00:06:58,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270587996] [2019-11-20 00:06:58,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:06:58,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:06:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:06:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:06:58,884 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2019-11-20 00:06:59,626 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 00:06:59,986 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-20 00:07:00,867 WARN L191 SmtUtils]: Spent 801.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-20 00:07:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:04,210 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-11-20 00:07:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:07:04,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-20 00:07:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:04,230 INFO L225 Difference]: With dead ends: 81 [2019-11-20 00:07:04,230 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 00:07:04,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:07:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 00:07:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-11-20 00:07:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 00:07:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-11-20 00:07:04,247 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 21 [2019-11-20 00:07:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:04,248 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-11-20 00:07:04,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:07:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-11-20 00:07:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:07:04,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:04,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:04,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 00:07:04,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:07:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2019-11-20 00:07:04,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:04,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293792874] [2019-11-20 00:07:04,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 00:07:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:05,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 00:07:05,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:05,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:07:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:07:05,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:05,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:07:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:07:05,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293792874] [2019-11-20 00:07:05,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:05,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 00:07:05,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812077041] [2019-11-20 00:07:05,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:07:05,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:07:05,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:07:05,657 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 13 states. [2019-11-20 00:07:09,984 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-20 00:07:10,334 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-20 00:07:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:12,784 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-11-20 00:07:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:07:12,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 00:07:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:12,796 INFO L225 Difference]: With dead ends: 70 [2019-11-20 00:07:12,796 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 00:07:12,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:07:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 00:07:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-20 00:07:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 00:07:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-20 00:07:12,804 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 23 [2019-11-20 00:07:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:12,804 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-20 00:07:12,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:07:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-20 00:07:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 00:07:12,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:12,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:13,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 00:07:13,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:07:13,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash -490549731, now seen corresponding path program 1 times [2019-11-20 00:07:13,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:13,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116846690] [2019-11-20 00:07:13,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 00:07:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:14,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:07:14,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:14,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 00:07:14,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 00:07:14,218 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:14,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:14,227 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:14,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:14,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:14,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:37 [2019-11-20 00:07:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:07:14,793 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:15,327 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 55 treesize of output 49 [2019-11-20 00:07:15,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 00:07:15,332 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:15,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:15,337 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:15,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:15,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:15,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-20 00:07:17,483 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:07:51,646 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 00:07:54,026 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (or (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (_ bv1141899264 32)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) (fp.div roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start_main_~x~0))) (not (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|)) v_arrayElimCell_14))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)))))) is different from true [2019-11-20 00:07:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:07:54,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116846690] [2019-11-20 00:07:54,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:54,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 00:07:54,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18990833] [2019-11-20 00:07:54,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 00:07:54,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 00:07:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=289, Unknown=8, NotChecked=34, Total=380 [2019-11-20 00:07:54,044 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 20 states. [2019-11-20 00:07:58,409 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 00:07:58,914 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 00:07:59,536 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 00:08:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:08:00,073 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-20 00:08:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 00:08:00,083 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-20 00:08:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:08:00,083 INFO L225 Difference]: With dead ends: 62 [2019-11-20 00:08:00,083 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 00:08:00,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=175, Invalid=523, Unknown=8, NotChecked=50, Total=756 [2019-11-20 00:08:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 00:08:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-20 00:08:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 00:08:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-20 00:08:00,091 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-11-20 00:08:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:08:00,091 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-20 00:08:00,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 00:08:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-20 00:08:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 00:08:00,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:08:00,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:08:00,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 00:08:00,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:08:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:08:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash 70268002, now seen corresponding path program 1 times [2019-11-20 00:08:00,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:08:00,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422686266] [2019-11-20 00:08:00,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 00:08:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:08:01,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 00:08:01,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:08:01,889 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 66 treesize of output 60 [2019-11-20 00:08:01,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:01,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:01,905 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:01,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:01,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:01,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:94 [2019-11-20 00:08:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:08:02,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:08:02,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,535 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 67 treesize of output 61 [2019-11-20 00:08:03,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:03,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:03,542 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:03,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:03,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:03,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:49 [2019-11-20 00:08:06,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) is different from false [2019-11-20 00:08:08,513 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) is different from true [2019-11-20 00:08:10,878 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) (bvsgt c_ULTIMATE.start___ieee754_atan2_~k~0 (_ bv60 32))) is different from true [2019-11-20 00:08:13,240 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) (bvsgt (bvashr (bvadd (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1) c_ULTIMATE.start___ieee754_atan2_~iy~0) (_ bv20 32)) (_ bv60 32))) is different from true [2019-11-20 00:08:15,608 WARN L860 $PredicateComparison]: unable to prove that (or (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_atan2_~hy~0) (bvneg c_ULTIMATE.start___ieee754_atan2_~ix~1)) (_ bv20 32)) (_ bv60 32)) (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32)))))) is different from true [2019-11-20 00:09:02,373 WARN L191 SmtUtils]: Spent 8.59 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 00:10:08,757 WARN L191 SmtUtils]: Spent 11.41 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 00:10:11,175 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) (forall ((v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) c_ULTIMATE.start___ieee754_atan2_~y)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) c_ULTIMATE.start___ieee754_atan2_~x)) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)))) (_ bv20 32)) (_ bv60 32))))) is different from false [2019-11-20 00:10:13,540 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32))))) (forall ((v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) c_ULTIMATE.start___ieee754_atan2_~y)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) c_ULTIMATE.start___ieee754_atan2_~x)) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)))) (_ bv20 32)) (_ bv60 32))))) is different from true [2019-11-20 00:10:15,935 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) c_ULTIMATE.start_main_~x~0)) (bvsgt (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (bvneg (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)))) (_ bv20 32)) (_ bv60 32)) (not (fp.gt .cse0 (_ +zero 11 53))) (not (bvsgt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) (_ bv2146435072 32)))))) is different from true [2019-11-20 00:10:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:10:15,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422686266] [2019-11-20 00:10:15,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:10:15,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 17] imperfect sequences [] total 32 [2019-11-20 00:10:15,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039434759] [2019-11-20 00:10:15,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 00:10:15,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:10:15,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 00:10:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=546, Unknown=32, NotChecked=318, Total=992 [2019-11-20 00:10:15,959 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 32 states. [2019-11-20 00:10:19,492 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-11-20 00:10:20,983 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-11-20 00:10:21,364 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-11-20 00:10:24,525 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 00:10:26,426 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 00:10:27,358 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 00:10:31,050 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-20 00:10:35,826 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-20 00:10:38,632 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 00:10:40,361 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-20 00:10:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:10:40,645 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-20 00:10:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 00:10:40,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-11-20 00:10:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:10:40,656 INFO L225 Difference]: With dead ends: 45 [2019-11-20 00:10:40,657 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 00:10:40,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 148.4s TimeCoverageRelationStatistics Valid=390, Invalid=1162, Unknown=32, NotChecked=486, Total=2070 [2019-11-20 00:10:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 00:10:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-20 00:10:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 00:10:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-11-20 00:10:40,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 36 [2019-11-20 00:10:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:10:40,666 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-11-20 00:10:40,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 00:10:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-11-20 00:10:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 00:10:40,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:10:40,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:10:40,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 00:10:40,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:10:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:10:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -85724530, now seen corresponding path program 1 times [2019-11-20 00:10:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:10:40,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239415914] [2019-11-20 00:10:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 00:10:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:10:42,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:10:42,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:10:42,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 00:10:42,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:10:42,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 00:10:42,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-20 00:10:42,388 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 00:10:42,409 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,419 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:10:42,431 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:27 [2019-11-20 00:10:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:10:42,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:10:42,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 54 [2019-11-20 00:10:42,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 00:10:42,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 00:10:42,601 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,604 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:10:42,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:10:42,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:10:42,614 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:26 [2019-11-20 00:10:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:10:42,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239415914] [2019-11-20 00:10:42,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:10:42,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 00:10:42,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402801356] [2019-11-20 00:10:42,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:10:42,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:10:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:10:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:10:42,820 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 8 states. [2019-11-20 00:10:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:10:42,821 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2019-11-20 00:10:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:10:42,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-11-20 00:10:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:10:42,822 INFO L225 Difference]: With dead ends: 38 [2019-11-20 00:10:42,822 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:10:42,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:10:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:10:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:10:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:10:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:10:42,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 00:10:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:10:42,823 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:10:42,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:10:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:10:42,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:10:43,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 00:10:43,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:10:49,837 WARN L191 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:10:49,839 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-20 00:10:49,839 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-20 00:10:49,840 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= |ULTIMATE.start___ieee754_atan2_#res| (fp.add roundNearestTiesToEven ~pi_o_2~0 .cse0)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (fp.gt (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (fp.gt (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (= ~tiny_atan2~0 .cse0) (fp.gt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)))) [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-20 00:10:49,841 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: false [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-20 00:10:49,842 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:10:49,843 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: false [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2019-11-20 00:10:49,844 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,845 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:10:49,846 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 00:10:49,847 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-20 00:10:49,847 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 00:10:49,847 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2019-11-20 00:10:49,848 INFO L447 ceAbstractionStarter]: At program point L264(lines 244 265) the Hoare annotation is: true [2019-11-20 00:10:49,849 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 00:10:49,849 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 00:10:49,849 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-20 00:10:49,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,882 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,888 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,888 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:49,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:49,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:49,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:10:49 BoogieIcfgContainer [2019-11-20 00:10:49,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:10:49,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:10:49,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:10:49,898 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:10:49,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:31" (3/4) ... [2019-11-20 00:10:49,902 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:10:49,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-20 00:10:49,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 00:10:49,935 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 00:10:49,992 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE())) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: v_skolemized_q#valueAsBitvector_31[63:32] == hx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE())) && hy == v_skolemized_v_prenex_22_3[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) [2019-11-20 00:10:50,071 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_10301c60-9b5b-4d56-8577-416370a4229b/bin/uautomizer/witness.graphml [2019-11-20 00:10:50,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:10:50,075 INFO L168 Benchmark]: Toolchain (without parser) took 297487.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -320.2 MB). Peak memory consumption was 396.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,075 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:10:50,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,079 INFO L168 Benchmark]: Boogie Preprocessor took 93.95 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,079 INFO L168 Benchmark]: RCFGBuilder took 38325.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,080 INFO L168 Benchmark]: TraceAbstraction took 258297.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.0 GB in the beginning and 814.6 MB in the end (delta: 233.4 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:10:50,081 INFO L168 Benchmark]: Witness Printer took 173.44 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 29.9 MB). Free memory was 814.6 MB in the beginning and 1.3 GB in the end (delta: -462.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:10:50,083 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 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.95 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38325.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258297.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.7 MB). Free memory was 1.0 GB in the beginning and 814.6 MB in the end (delta: 233.4 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. * Witness Printer took 173.44 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 29.9 MB). Free memory was 814.6 MB in the beginning and 1.3 GB in the end (delta: -462.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 142]: Loop Invariant [2019-11-20 00:10:50,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-20 00:10:50,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 00:10:50,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-20 00:10:50,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((\result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE())) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: v_skolemized_q#valueAsBitvector_31[63:32] == hx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (ly == v_skolemized_v_prenex_22_3[31:0] && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]), ~Pluszero~LONGDOUBLE())) && hy == v_skolemized_v_prenex_22_3[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: SAFE, OverallTime: 258.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, HoareTripleCheckerStatistics: 555 SDtfs, 1973 SDslu, 1399 SDs, 0 SdLazy, 472 SolverSat, 29 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 142 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 216.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 20 NumberOfFragments, 116 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 124 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 192.6s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 412 ConstructedInterpolants, 125 QuantifiedInterpolants, 177582 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...