./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0662a.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_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 ........................................................................................................................................................................................................................................................................................................................ 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_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:44:36,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:44:36,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:44:36,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:44:36,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:44:36,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:44:36,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:44:36,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:44:36,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:44:36,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:44:36,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:44:36,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:44:36,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:44:36,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:44:36,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:44:36,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:44:36,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:44:36,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:44:36,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:44:36,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:44:36,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:44:36,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:44:36,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:44:36,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:44:36,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:44:36,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:44:36,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:44:36,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:44:36,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:44:36,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:44:36,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:44:36,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:44:36,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:44:36,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:44:36,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:44:36,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:44:36,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:44:36,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:44:36,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:44:36,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:44:36,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:44:36,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:44:36,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:44:36,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:44:36,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:44:36,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:44:36,440 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:44:36,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:44:36,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:44:36,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:44:36,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:44:36,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:44:36,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:44:36,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:44:36,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:44:36,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:44:36,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:44:36,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:44:36,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:44:36,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:44:36,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:44:36,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:44:36,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:44:36,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:44:36,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:44:36,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:44:36,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:44:36,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:44:36,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:44:36,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:44:36,447 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_b25294c0-b305-4e00-a9f6-3f1108220184/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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2019-11-19 22:44:36,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:44:36,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:44:36,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:44:36,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:44:36,611 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:44:36,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2019-11-19 22:44:36,669 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/8c082ce20/1e4cd08fab0e467bba570e004c16f343/FLAGdb7c08eaf [2019-11-19 22:44:37,035 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:44:37,036 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2019-11-19 22:44:37,043 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/8c082ce20/1e4cd08fab0e467bba570e004c16f343/FLAGdb7c08eaf [2019-11-19 22:44:37,475 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/8c082ce20/1e4cd08fab0e467bba570e004c16f343 [2019-11-19 22:44:37,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:44:37,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:44:37,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:37,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:44:37,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:44:37,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7b016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37, skipping insertion in model container [2019-11-19 22:44:37,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,492 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:44:37,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:44:37,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:37,810 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:44:37,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:37,889 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:44:37,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37 WrapperNode [2019-11-19 22:44:37,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:37,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:37,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:44:37,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:44:37,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:37,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:44:37,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:44:37,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:44:37,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:37,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:38,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:38,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:38,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... [2019-11-19 22:44:38,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:44:38,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:44:38,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:44:38,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:44:38,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:44:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:44:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-19 22:44:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:44:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 22:44:38,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:44:38,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:44:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:44:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-19 22:44:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:44:38,961 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:44:38,961 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-19 22:44:38,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:38 BoogieIcfgContainer [2019-11-19 22:44:38,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:44:38,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:44:38,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:44:38,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:44:38,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:44:37" (1/3) ... [2019-11-19 22:44:38,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b6e5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:44:38, skipping insertion in model container [2019-11-19 22:44:38,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:37" (2/3) ... [2019-11-19 22:44:38,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b6e5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:44:38, skipping insertion in model container [2019-11-19 22:44:38,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:38" (3/3) ... [2019-11-19 22:44:38,969 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a.c [2019-11-19 22:44:38,978 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:44:38,984 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:44:38,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:44:39,016 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:44:39,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:44:39,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:44:39,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:44:39,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:44:39,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:44:39,017 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:44:39,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:44:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-19 22:44:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:44:39,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:44:39,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:44:39,041 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:44:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:44:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-19 22:44:39,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:44:39,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883228125] [2019-11-19 22:44:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:44:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:44:39,173 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-19 22:44:39,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883228125] [2019-11-19 22:44:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:44:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:44:39,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793418866] [2019-11-19 22:44:39,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:44:39,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:44:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:44:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:44:39,193 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-19 22:44:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:44:39,219 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-19 22:44:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:44:39,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 22:44:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:44:39,228 INFO L225 Difference]: With dead ends: 227 [2019-11-19 22:44:39,229 INFO L226 Difference]: Without dead ends: 111 [2019-11-19 22:44:39,231 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-19 22:44:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-19 22:44:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-19 22:44:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 22:44:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-19 22:44:39,271 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-19 22:44:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:44:39,271 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-19 22:44:39,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:44:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-19 22:44:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:44:39,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:44:39,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:44:39,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:44:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:44:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-19 22:44:39,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:44:39,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062639737] [2019-11-19 22:44:39,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:44:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:44:39,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:44:39,482 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:44:39,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:44:39 BoogieIcfgContainer [2019-11-19 22:44:39,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:44:39,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:44:39,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:44:39,546 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:44:39,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:44:38" (3/4) ... [2019-11-19 22:44:39,550 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:44:39,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:44:39,552 INFO L168 Benchmark]: Toolchain (without parser) took 2072.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -83.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:39,552 INFO L168 Benchmark]: CDTParser took 0.23 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-19 22:44:39,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:39,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:39,554 INFO L168 Benchmark]: Boogie Preprocessor took 95.92 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-19 22:44:39,555 INFO L168 Benchmark]: RCFGBuilder took 911.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:39,555 INFO L168 Benchmark]: TraceAbstraction took 581.30 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:44:39,556 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:44:39,559 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.23 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 410.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 911.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 581.30 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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 251, 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-19 22:44:41,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:44:41,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:44:41,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:44:41,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:44:41,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:44:41,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:44:41,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:44:41,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:44:41,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:44:41,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:44:41,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:44:41,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:44:41,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:44:41,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:44:41,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:44:41,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:44:41,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:44:41,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:44:41,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:44:41,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:44:41,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:44:41,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:44:41,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:44:41,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:44:41,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:44:41,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:44:41,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:44:41,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:44:41,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:44:41,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:44:41,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:44:41,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:44:41,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:44:41,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:44:41,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:44:41,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:44:41,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:44:41,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:44:41,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:44:41,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:44:41,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 22:44:41,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:44:41,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:44:41,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:44:41,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:44:41,441 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:44:41,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:44:41,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:44:41,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:44:41,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:44:41,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:44:41,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:44:41,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:44:41,443 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:44:41,443 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:44:41,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:44:41,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:44:41,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:44:41,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:44:41,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:44:41,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:44:41,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:44:41,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:44:41,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:44:41,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:44:41,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:44:41,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:44:41,447 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:44:41,447 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:44:41,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:44:41,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:44:41,448 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_b25294c0-b305-4e00-a9f6-3f1108220184/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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2019-11-19 22:44:41,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:44:41,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:44:41,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:44:41,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:44:41,723 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:44:41,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2019-11-19 22:44:41,772 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/a18320e0c/14e7662254994bb089c3742b22d2dbd5/FLAG04c153c1c [2019-11-19 22:44:42,130 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:44:42,131 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2019-11-19 22:44:42,139 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/a18320e0c/14e7662254994bb089c3742b22d2dbd5/FLAG04c153c1c [2019-11-19 22:44:42,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/data/a18320e0c/14e7662254994bb089c3742b22d2dbd5 [2019-11-19 22:44:42,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:44:42,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:44:42,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:42,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:44:42,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:44:42,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:42" (1/1) ... [2019-11-19 22:44:42,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19339ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:42, skipping insertion in model container [2019-11-19 22:44:42,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:44:42" (1/1) ... [2019-11-19 22:44:42,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:44:42,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:44:42,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:42,814 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:44:42,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:44:43,002 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:44:43,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43 WrapperNode [2019-11-19 22:44:43,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:44:43,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:43,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:44:43,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:44:43,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:44:43,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:44:43,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:44:43,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:44:43,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... [2019-11-19 22:44:43,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:44:43,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:44:43,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:44:43,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:44:43,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:44:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-19 22:44:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 22:44:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:44:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-19 22:44:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:44:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:44:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:44:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 22:44:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:45:20,967 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:45:20,967 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-19 22:45:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:45:20 BoogieIcfgContainer [2019-11-19 22:45:20,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:45:20,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:45:20,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:45:20,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:45:20,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:44:42" (1/3) ... [2019-11-19 22:45:20,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4811674e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:45:20, skipping insertion in model container [2019-11-19 22:45:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:44:43" (2/3) ... [2019-11-19 22:45:20,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4811674e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:45:20, skipping insertion in model container [2019-11-19 22:45:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:45:20" (3/3) ... [2019-11-19 22:45:20,977 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a.c [2019-11-19 22:45:20,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:45:20,993 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:45:21,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:45:21,025 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:45:21,025 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:45:21,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:45:21,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:45:21,026 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:45:21,026 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:45:21,026 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:45:21,026 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:45:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-19 22:45:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:45:21,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:21,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:45:21,053 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-11-19 22:45:21,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:21,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873019952] [2019-11-19 22:45:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:21,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 22:45:21,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:21,415 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-19 22:45:21,416 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:21,420 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-19 22:45:21,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873019952] [2019-11-19 22:45:21,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:21,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:45:21,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580963298] [2019-11-19 22:45:21,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:45:21,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:45:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:45:21,446 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-11-19 22:45:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:21,477 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-11-19 22:45:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:45:21,479 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 22:45:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:21,492 INFO L225 Difference]: With dead ends: 227 [2019-11-19 22:45:21,492 INFO L226 Difference]: Without dead ends: 111 [2019-11-19 22:45:21,496 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-19 22:45:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-19 22:45:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-19 22:45:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 22:45:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-11-19 22:45:21,569 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-11-19 22:45:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:21,570 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-11-19 22:45:21,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:45:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-11-19 22:45:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:45:21,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:21,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:45:21,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 22:45:21,788 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-11-19 22:45:21,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:21,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050708349] [2019-11-19 22:45:21,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:22,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:45:22,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:22,453 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-19 22:45:22,479 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-19 22:45:22,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:22,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:22,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:22,534 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-19 22:45:22,535 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:22,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:22,538 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-19 22:45:22,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:22,576 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-19 22:45:22,577 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:62, output treesize:34 [2019-11-19 22:45:23,148 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-19 22:45:23,148 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:23,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,404 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-19 22:45:23,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,458 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-19 22:45:23,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:23,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,500 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-19 22:45:23,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:23,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,514 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-19 22:45:23,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,562 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-19 22:45:23,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,585 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-19 22:45:23,585 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:23,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,610 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:45:23,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:23,664 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-19 22:45:23,664 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-19 22:45:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:24,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:24,206 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-19 22:45:24,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050708349] [2019-11-19 22:45:24,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:24,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-19 22:45:24,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354745131] [2019-11-19 22:45:24,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:45:24,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:45:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:45:24,209 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 14 states. [2019-11-19 22:45:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:26,789 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2019-11-19 22:45:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:45:27,177 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-11-19 22:45:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:27,178 INFO L225 Difference]: With dead ends: 167 [2019-11-19 22:45:27,179 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 22:45:27,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:45:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 22:45:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 22:45:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 22:45:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2019-11-19 22:45:27,192 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 13 [2019-11-19 22:45:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:27,192 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-11-19 22:45:27,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:45:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2019-11-19 22:45:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:45:27,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:27,194 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-19 22:45:27,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 22:45:27,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2019-11-19 22:45:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:27,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692687037] [2019-11-19 22:45:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:27,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:45:27,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:27,874 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:28,027 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:28,181 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:28,185 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-19 22:45:28,185 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:30,211 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-19 22:45:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:45:30,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692687037] [2019-11-19 22:45:30,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:30,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-19 22:45:30,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494765183] [2019-11-19 22:45:30,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:45:30,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:45:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:45:30,217 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 10 states. [2019-11-19 22:45:30,758 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 22:45:30,920 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 22:45:32,390 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-19 22:45:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:33,925 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-11-19 22:45:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:45:33,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-19 22:45:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:33,929 INFO L225 Difference]: With dead ends: 72 [2019-11-19 22:45:33,929 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 22:45:33,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:45:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 22:45:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-19 22:45:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 22:45:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2019-11-19 22:45:33,939 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2019-11-19 22:45:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:33,939 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2019-11-19 22:45:33,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:45:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2019-11-19 22:45:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:45:33,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:33,941 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-19 22:45:34,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 22:45:34,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2019-11-19 22:45:34,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:34,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834901397] [2019-11-19 22:45:34,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:34,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:45:34,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:34,904 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:35,300 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:35,483 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:45:35,486 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-19 22:45:35,487 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:37,949 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-19 22:45:37,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834901397] [2019-11-19 22:45:37,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:37,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-19 22:45:37,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177490158] [2019-11-19 22:45:37,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:45:37,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:45:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:45:37,951 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 10 states. [2019-11-19 22:45:38,523 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 22:45:39,320 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 22:45:39,936 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-19 22:45:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:42,135 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-19 22:45:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:45:42,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 22:45:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:42,146 INFO L225 Difference]: With dead ends: 70 [2019-11-19 22:45:42,146 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 22:45:42,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:45:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 22:45:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-19 22:45:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 22:45:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-19 22:45:42,155 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 20 [2019-11-19 22:45:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:42,155 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-19 22:45:42,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:45:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-19 22:45:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:45:42,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:42,157 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-19 22:45:42,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 22:45:42,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-11-19 22:45:42,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:42,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156585104] [2019-11-19 22:45:42,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:42,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:45:42,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:42,914 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-19 22:45:42,914 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:43,091 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-19 22:45:43,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156585104] [2019-11-19 22:45:43,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:43,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-19 22:45:43,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600078477] [2019-11-19 22:45:43,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:45:43,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:45:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:45:43,093 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 11 states. [2019-11-19 22:45:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:45,665 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2019-11-19 22:45:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:45:45,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-19 22:45:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:45,669 INFO L225 Difference]: With dead ends: 68 [2019-11-19 22:45:45,669 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 22:45:45,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:45:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 22:45:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 22:45:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 22:45:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-11-19 22:45:45,678 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 21 [2019-11-19 22:45:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:45,678 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-11-19 22:45:45,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:45:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-11-19 22:45:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:45:45,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:45,679 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-19 22:45:45,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 22:45:45,880 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2019-11-19 22:45:45,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:45,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173586628] [2019-11-19 22:45:45,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:46,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 22:45:46,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:48,205 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-19 22:45:48,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:48,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:48,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:45:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:45:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:45:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:45:49,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:45:49,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:45:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:45:50,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173586628] [2019-11-19 22:45:50,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:50,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 13] imperfect sequences [] total 21 [2019-11-19 22:45:50,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787054283] [2019-11-19 22:45:50,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:45:50,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:45:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:45:50,307 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 21 states. [2019-11-19 22:45:51,049 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-19 22:45:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:54,142 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-11-19 22:45:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:45:54,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-11-19 22:45:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:54,145 INFO L225 Difference]: With dead ends: 63 [2019-11-19 22:45:54,145 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 22:45:54,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-11-19 22:45:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 22:45:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 22:45:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 22:45:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-11-19 22:45:54,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 23 [2019-11-19 22:45:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-19 22:45:54,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:45:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-11-19 22:45:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:45:54,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:45:54,164 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] [2019-11-19 22:45:54,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 22:45:54,365 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:45:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:45:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2019-11-19 22:45:54,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:45:54,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022642985] [2019-11-19 22:45:54,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/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-19 22:45:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:45:54,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:45:54,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:45:55,033 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-19 22:45:55,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:45:55,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 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-19 22:45:55,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,085 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 28 treesize of output 16 [2019-11-19 22:45:55,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,111 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 40 treesize of output 20 [2019-11-19 22:45:55,111 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,124 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-19 22:45:55,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,138 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-19 22:45:55,139 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:29 [2019-11-19 22:45:55,236 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-19 22:45:55,237 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:45:55,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,340 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 8 case distinctions, treesize of input 76 treesize of output 76 [2019-11-19 22:45:55,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,371 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 9 case distinctions, treesize of input 55 treesize of output 70 [2019-11-19 22:45:55,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,401 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 40 treesize of output 24 [2019-11-19 22:45:55,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,424 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 40 treesize of output 24 [2019-11-19 22:45:55,424 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:45:55,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,433 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-19 22:45:55,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:45:55,448 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-19 22:45:55,448 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:32 [2019-11-19 22:45:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:45:55,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022642985] [2019-11-19 22:45:55,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:45:55,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 22:45:55,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168400960] [2019-11-19 22:45:55,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:45:55,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:45:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:45:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:45:55,520 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 10 states. [2019-11-19 22:45:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:45:55,654 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-19 22:45:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:45:55,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-19 22:45:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:45:55,655 INFO L225 Difference]: With dead ends: 59 [2019-11-19 22:45:55,655 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:45:55,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:45:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:45:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:45:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:45:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:45:55,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-19 22:45:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:45:55,671 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:45:55,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:45:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:45:55,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:45:55,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 22:45:55,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:45:56,133 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-11-19 22:45:56,631 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 22:45:56,633 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-19 22:45:56,633 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-19 22:45:56,634 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-19 22:45:56,635 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (fp.lt (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_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_3)) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) .cse1)) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 .cse1) (= ULTIMATE.start_main_~x~0 .cse0))) [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-19 22:45:56,636 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ULTIMATE.start_main_~x~0 .cse0))) [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-19 22:45:56,637 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-19 22:45:56,638 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_35|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 .cse1) (= ((_ extract 31 0) v_skolemized_v_prenex_19_3) .cse2) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= (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|)) (fp.neg (_ +zero 11 53)))))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ULTIMATE.start_main_~x~0 .cse0))) [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2019-11-19 22:45:56,639 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-19 22:45:56,640 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-19 22:45:56,641 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-19 22:45:56,642 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-19 22:45:56,642 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-19 22:45:56,642 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-19 22:45:56,643 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-19 22:45:56,644 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:45:56,644 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2019-11-19 22:45:56,644 INFO L447 ceAbstractionStarter]: At program point L265(lines 244 266) the Hoare annotation is: true [2019-11-19 22:45:56,644 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 22:45:56,644 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-19 22:45:56,644 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-19 22:45:56,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,671 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,678 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,680 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:45:56 BoogieIcfgContainer [2019-11-19 22:45:56,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:45:56,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:45:56,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:45:56,719 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:45:56,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:45:20" (3/4) ... [2019-11-19 22:45:56,723 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:45:56,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-19 22:45:56,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-19 22:45:56,762 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 22:45:56,807 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_19_3 : bv64, v_skolemized_q#valueAsBitvector_35 : bv64 :: (((hx == v_skolemized_v_prenex_19_3[63:32] && v_skolemized_v_prenex_19_3[31:0] == v_skolemized_q#valueAsBitvector_35[31:0]) && v_skolemized_v_prenex_19_3[63:32] == v_skolemized_q#valueAsBitvector_35[63:32]) && lx == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-19 22:45:56,807 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~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()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~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()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-19 22:45:56,898 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b25294c0-b305-4e00-a9f6-3f1108220184/bin/uautomizer/witness.graphml [2019-11-19 22:45:56,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:45:56,899 INFO L168 Benchmark]: Toolchain (without parser) took 74396.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -250.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,900 INFO L168 Benchmark]: CDTParser took 0.25 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-19 22:45:56,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -196.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,901 INFO L168 Benchmark]: Boogie Preprocessor took 66.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,901 INFO L168 Benchmark]: RCFGBuilder took 37829.04 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: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,902 INFO L168 Benchmark]: TraceAbstraction took 35748.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:45:56,902 INFO L168 Benchmark]: Witness Printer took 179.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:45:56,909 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.25 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 498.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -196.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 37829.04 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: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35748.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 179.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. 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 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_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_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,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_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_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,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 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 - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 [2019-11-19 22:45:56,924 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,924 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - 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: 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: 244]: Loop Invariant Derived loop invariant: 1 - 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 [2019-11-19 22:45:56,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_19_3,QUANTIFIED] [2019-11-19 22:45:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2019-11-19 22:45:56,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_19_3 : bv64, v_skolemized_q#valueAsBitvector_35 : bv64 :: (((hx == v_skolemized_v_prenex_19_3[63:32] && v_skolemized_v_prenex_19_3[31:0] == v_skolemized_q#valueAsBitvector_35[31:0]) && v_skolemized_v_prenex_19_3[63:32] == v_skolemized_q#valueAsBitvector_35[63:32]) && lx == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 142]: Loop Invariant [2019-11-19 22:45:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 22:45:56,949 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-19 22:45:56,950 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,950 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:45:56,951 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~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()) && ly == v_skolemized_v_prenex_22_3[31:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && (\exists v_skolemized_v_prenex_22_3 : bv64 :: (~fp.lt~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()) && ly == v_skolemized_v_prenex_22_3[31:0]) && iy == ~bvand32(2147483647bv32, v_skolemized_v_prenex_22_3[63:32]))) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Result: SAFE, OverallTime: 35.6s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 519 SDtfs, 1828 SDslu, 946 SDs, 0 SdLazy, 215 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 176 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 14.8s 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 211 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 246 ConstructedInterpolants, 70 QuantifiedInterpolants, 74389 SizeOfPredicates, 54 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...