./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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 baa80d60694a6a02d32fddddbbe44c204edcedd1 ........................................................................................................................................................................................................................................................................................................................... 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_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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 baa80d60694a6a02d32fddddbbe44c204edcedd1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:48,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:48,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:48,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:48,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:48,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:48,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:48,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:48,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:48,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:48,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:48,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:48,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:48,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:48,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:48,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:48,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:48,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:48,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:48,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:48,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:48,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:48,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:48,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:48,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:48,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:48,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:48,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:48,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:48,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:48,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:48,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:48,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:48,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:48,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:48,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:48,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:48,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:48,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:48,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:48,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:48,537 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:37:48,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:48,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:48,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:48,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:48,574 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:48,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:48,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:48,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:48,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:48,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:48,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:48,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:48,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:48,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:48,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:48,576 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:48,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:48,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:48,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:48,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:48,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:48,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:48,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:48,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:48,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:48,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:37:48,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:37:48,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:48,581 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_92e2a5d2-630c-47e8-8e0e-b57919364c38/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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-11-16 00:37:48,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:48,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:48,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:48,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:48,631 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:48,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-16 00:37:48,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/1b5e2a4bb/037c28baf8d048729c55d03911a7a4e0/FLAGa23107c32 [2019-11-16 00:37:49,076 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:49,078 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-16 00:37:49,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/1b5e2a4bb/037c28baf8d048729c55d03911a7a4e0/FLAGa23107c32 [2019-11-16 00:37:49,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/1b5e2a4bb/037c28baf8d048729c55d03911a7a4e0 [2019-11-16 00:37:49,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:49,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:49,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:49,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:49,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:49,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e8593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49, skipping insertion in model container [2019-11-16 00:37:49,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:49,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:49,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:49,744 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:49,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:49,824 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:49,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49 WrapperNode [2019-11-16 00:37:49,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:49,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:49,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:49,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:49,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:49,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:49,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:49,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:49,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:49,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... [2019-11-16 00:37:50,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:50,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:50,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:50,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:50,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:37:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-16 00:37:50,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:37:50,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-16 00:37:50,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:50,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:50,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:37:50,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-16 00:37:50,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:37:50,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:50,779 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-16 00:37:50,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:50 BoogieIcfgContainer [2019-11-16 00:37:50,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:50,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:50,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:50,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:50,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:49" (1/3) ... [2019-11-16 00:37:50,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d59a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:50, skipping insertion in model container [2019-11-16 00:37:50,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:49" (2/3) ... [2019-11-16 00:37:50,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d59a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:50, skipping insertion in model container [2019-11-16 00:37:50,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:50" (3/3) ... [2019-11-16 00:37:50,789 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a.c [2019-11-16 00:37:50,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:50,807 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:37:50,819 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:37:50,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:50,856 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:50,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:50,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:50,857 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:50,857 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:50,857 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:50,857 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-16 00:37:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:37:50,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:50,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-16 00:37:50,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277381119] [2019-11-16 00:37:50,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,017 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-16 00:37:51,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277381119] [2019-11-16 00:37:51,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:37:51,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050214135] [2019-11-16 00:37:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:37:51,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:37:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:37:51,038 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-16 00:37:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,066 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-16 00:37:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:37:51,068 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:37:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,079 INFO L225 Difference]: With dead ends: 224 [2019-11-16 00:37:51,079 INFO L226 Difference]: Without dead ends: 110 [2019-11-16 00:37:51,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:37:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-16 00:37:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-16 00:37:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:37:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-16 00:37:51,122 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-16 00:37:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,123 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-16 00:37:51,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:37:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-16 00:37:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:37:51,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:51,124 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-16 00:37:51,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745737076] [2019-11-16 00:37:51,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:37:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:37:51,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:37:51,346 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:37:51,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:37:51 BoogieIcfgContainer [2019-11-16 00:37:51,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:37:51,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:37:51,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:37:51,382 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:37:51,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:50" (3/4) ... [2019-11-16 00:37:51,386 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:37:51,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:37:51,388 INFO L168 Benchmark]: Toolchain (without parser) took 1976.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -83.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:51,389 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:51,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:51,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.68 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-16 00:37:51,390 INFO L168 Benchmark]: Boogie Preprocessor took 81.43 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-16 00:37:51,391 INFO L168 Benchmark]: RCFGBuilder took 775.74 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-16 00:37:51,392 INFO L168 Benchmark]: TraceAbstraction took 600.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:51,392 INFO L168 Benchmark]: Witness Printer took 4.15 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-16 00:37:51,395 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.68 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 81.43 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 775.74 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 600.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 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: 257]: 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 256. 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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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 = -0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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] [L254] double res = __ieee754_atan2(y, x); [L256] COND TRUE res != -pi VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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] [L257] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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, 113 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 161 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=113occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:53,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:53,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:53,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:53,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:53,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:53,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:53,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:53,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:53,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:53,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:53,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:53,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:53,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:53,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:53,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:53,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:53,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:53,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:53,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:53,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:53,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:53,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:53,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:53,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:53,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:53,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:53,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:53,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:53,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:53,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:53,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:53,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:53,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:53,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:53,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:53,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:53,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:53,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:53,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:53,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:53,590 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:37:53,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:53,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:53,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:53,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:53,606 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:53,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:53,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:53,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:53,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:53,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:53,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:53,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:53,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:37:53,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:37:53,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:53,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:53,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:53,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:53,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:53,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:53,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:53,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:53,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:53,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:53,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:37:53,624 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_92e2a5d2-630c-47e8-8e0e-b57919364c38/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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-11-16 00:37:53,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:53,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:53,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:53,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:53,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:53,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-16 00:37:53,719 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/6e5b100d0/adb2b6dacde3428588ce2898010f57a9/FLAG6c7304cd9 [2019-11-16 00:37:54,173 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:54,174 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-16 00:37:54,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/6e5b100d0/adb2b6dacde3428588ce2898010f57a9/FLAG6c7304cd9 [2019-11-16 00:37:54,560 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/data/6e5b100d0/adb2b6dacde3428588ce2898010f57a9 [2019-11-16 00:37:54,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:54,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:54,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:54,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:54,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:54,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df8c76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54, skipping insertion in model container [2019-11-16 00:37:54,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,578 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:54,615 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:54,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:54,937 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:55,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:55,030 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:55,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55 WrapperNode [2019-11-16 00:37:55,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:55,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:55,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:55,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:55,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:55,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:55,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:55,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:55,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... [2019-11-16 00:37:55,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:55,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:55,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:55,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:55,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:37:55,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-16 00:37:55,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-16 00:37:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-16 00:37:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:37:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:37:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:38:32,934 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:38:32,934 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-16 00:38:32,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:32 BoogieIcfgContainer [2019-11-16 00:38:32,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:38:32,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:38:32,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:38:32,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:38:32,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:54" (1/3) ... [2019-11-16 00:38:32,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4029f94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:32, skipping insertion in model container [2019-11-16 00:38:32,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:55" (2/3) ... [2019-11-16 00:38:32,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4029f94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:32, skipping insertion in model container [2019-11-16 00:38:32,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:32" (3/3) ... [2019-11-16 00:38:32,944 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a.c [2019-11-16 00:38:32,955 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:38:32,960 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:38:32,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:38:32,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:38:32,990 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:38:32,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:38:32,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:38:32,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:38:32,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:38:32,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:38:32,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:38:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-16 00:38:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:38:33,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:33,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:33,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-16 00:38:33,026 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:33,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718405809] [2019-11-16 00:38:33,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:33,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:38:33,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:33,404 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-16 00:38:33,405 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:33,408 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-16 00:38:33,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718405809] [2019-11-16 00:38:33,412 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:33,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:38:33,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644708495] [2019-11-16 00:38:33,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:38:33,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:33,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:38:33,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:38:33,431 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-16 00:38:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:33,457 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-16 00:38:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:38:33,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:38:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:33,475 INFO L225 Difference]: With dead ends: 224 [2019-11-16 00:38:33,476 INFO L226 Difference]: Without dead ends: 110 [2019-11-16 00:38:33,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:38:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-16 00:38:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-16 00:38:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:38:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-16 00:38:33,529 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-16 00:38:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:33,529 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-16 00:38:33,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:38:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-16 00:38:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:38:33,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:33,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:33,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-16 00:38:33,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-16 00:38:33,735 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:33,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208923304] [2019-11-16 00:38:33,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:34,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:38:34,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:34,238 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-16 00:38:34,238 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:34,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,831 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-16 00:38:34,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208923304] [2019-11-16 00:38:34,832 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:34,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-16 00:38:34,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620614250] [2019-11-16 00:38:34,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:38:34,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:38:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:38:34,834 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 12 states. [2019-11-16 00:38:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:38,175 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2019-11-16 00:38:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:38:38,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-11-16 00:38:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:38,179 INFO L225 Difference]: With dead ends: 161 [2019-11-16 00:38:38,180 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:38:38,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:38:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:38:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:38:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:38:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2019-11-16 00:38:38,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2019-11-16 00:38:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:38,192 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2019-11-16 00:38:38,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:38:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2019-11-16 00:38:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:38:38,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:38,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:38,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-16 00:38:38,411 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash 808768545, now seen corresponding path program 1 times [2019-11-16 00:38:38,412 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:38,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819123924] [2019-11-16 00:38:38,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:38,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:38:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:38,876 INFO L375 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-16 00:38:38,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 24 treesize of output 27 [2019-11-16 00:38:38,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:38,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:38,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:38,923 INFO L375 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-16 00:38:38,923 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:38,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:38,927 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-16 00:38:38,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:38,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:38,945 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:19 [2019-11-16 00:38:39,004 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-16 00:38:39,005 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:39,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,065 INFO L375 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 39 treesize of output 39 [2019-11-16 00:38:39,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,104 INFO L375 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 31 treesize of output 35 [2019-11-16 00:38:39,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:39,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,125 INFO L375 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 31 treesize of output 19 [2019-11-16 00:38:39,126 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:39,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,129 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-16 00:38:39,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:39,139 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-16 00:38:39,165 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-16 00:38:39,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819123924] [2019-11-16 00:38:39,165 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:39,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:38:39,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14092391] [2019-11-16 00:38:39,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:38:39,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:38:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:39,167 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 8 states. [2019-11-16 00:38:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:40,563 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-16 00:38:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:38:40,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-16 00:38:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:40,946 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:38:40,946 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:38:40,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:38:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:38:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:38:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:38:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-11-16 00:38:40,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2019-11-16 00:38:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:40,956 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-11-16 00:38:40,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:38:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2019-11-16 00:38:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:38:40,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:40,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:41,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-16 00:38:41,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2019-11-16 00:38:41,163 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:41,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974105038] [2019-11-16 00:38:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:41,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:38:41,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:41,561 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-16 00:38:41,562 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:41,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:41,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:41,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:41,757 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-16 00:38:41,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974105038] [2019-11-16 00:38:41,757 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:41,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-16 00:38:41,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315342475] [2019-11-16 00:38:41,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:38:41,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:38:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:38:41,759 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 11 states. [2019-11-16 00:38:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:44,779 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-11-16 00:38:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:44,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-16 00:38:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:44,781 INFO L225 Difference]: With dead ends: 130 [2019-11-16 00:38:44,784 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:38:44,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:38:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:38:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:38:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:38:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-16 00:38:44,801 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2019-11-16 00:38:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:44,801 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-16 00:38:44,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:38:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-16 00:38:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:38:44,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:44,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:45,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-16 00:38:45,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2019-11-16 00:38:45,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:45,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843887168] [2019-11-16 00:38:45,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:45,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:38:45,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:45,553 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-16 00:38:45,554 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:45,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,169 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-16 00:38:46,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843887168] [2019-11-16 00:38:46,170 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:46,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 14 [2019-11-16 00:38:46,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345658315] [2019-11-16 00:38:46,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:38:46,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:38:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:38:46,172 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 14 states. [2019-11-16 00:38:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:48,648 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-11-16 00:38:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:38:48,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-16 00:38:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:48,654 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:38:48,654 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:38:48,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:38:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:38:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:38:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:38:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-11-16 00:38:48,676 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2019-11-16 00:38:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:48,677 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-11-16 00:38:48,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:38:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-11-16 00:38:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:38:48,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:48,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:48,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-16 00:38:48,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2019-11-16 00:38:48,899 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:48,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569904652] [2019-11-16 00:38:48,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:49,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:38:49,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:49,511 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-16 00:38:49,896 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-16 00:38:49,900 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-16 00:38:49,900 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:51,569 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-16 00:38:51,571 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-16 00:38:51,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569904652] [2019-11-16 00:38:51,571 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:51,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-16 00:38:51,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869966952] [2019-11-16 00:38:51,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:38:51,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:38:51,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:51,572 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 8 states. [2019-11-16 00:38:52,317 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-16 00:38:52,687 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-16 00:38:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:53,529 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-16 00:38:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:38:53,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:38:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:53,531 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:38:53,531 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:38:53,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:38:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:38:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:38:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:38:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-16 00:38:53,546 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-11-16 00:38:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:53,546 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-16 00:38:53,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:38:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-16 00:38:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:38:53,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:53,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:53,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-16 00:38:53,764 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1240434960, now seen corresponding path program 1 times [2019-11-16 00:38:53,765 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:53,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816653033] [2019-11-16 00:38:53,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/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-16 00:38:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:54,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:38:54,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:54,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:54,258 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-16 00:38:54,258 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:54,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:54,422 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-16 00:38:54,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816653033] [2019-11-16 00:38:54,422 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:54,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-16 00:38:54,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277964547] [2019-11-16 00:38:54,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:38:54,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:38:54,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:38:54,423 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 11 states. [2019-11-16 00:38:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:54,694 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-11-16 00:38:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:38:54,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-16 00:38:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:54,694 INFO L225 Difference]: With dead ends: 71 [2019-11-16 00:38:54,694 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:38:54,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:38:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:38:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:38:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:38:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:38:54,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-16 00:38:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:54,696 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:38:54,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:38:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:38:54,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:38:54,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-16 00:38:54,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:38:55,746 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L439 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-16 00:38:55,748 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-16 00:38:55,749 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L439 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_5) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) .cse1) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) .cse1)))) (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|))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (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))) (= (bvor ULTIMATE.start___ieee754_atan2_~iy~0 ULTIMATE.start___ieee754_atan2_~ly~0) (_ bv0 32)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_4)))) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) .cse2) |ULTIMATE.start___ieee754_atan2_#res|) (= ~tiny_atan2~0 .cse2) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L439 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L439 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-16 00:38:55,750 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L439 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) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-16 00:38:55,751 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L439 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-16 00:38:55,752 INFO L439 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|))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (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))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-16 00:38:55,752 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,753 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 259) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L257(line 257) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L439 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-16 00:38:55,754 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L446 ceAbstractionStarter]: At program point L260(lines 244 261) the Hoare annotation is: true [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L439 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-16 00:38:55,755 INFO L439 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-16 00:38:55,755 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-16 00:38:55,755 INFO L443 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L439 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L439 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-16 00:38:55,756 INFO L439 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-16 00:38:55,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,767 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,770 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,774 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,774 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:38:55 BoogieIcfgContainer [2019-11-16 00:38:55,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:38:55,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:38:55,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:38:55,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:38:55,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:32" (3/4) ... [2019-11-16 00:38:55,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:38:55,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-16 00:38:55,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-16 00:38:55,842 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]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\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)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) [2019-11-16 00:38:55,843 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_5 : bv64, v_skolemized_q#valueAsBitvector_34 : bv64 :: (~bvor32(~bvand32(1bv32, ~bvashr32(v_skolemized_v_prenex_22_5[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_34[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_5[63:63], v_skolemized_v_prenex_22_5[62:52], v_skolemized_v_prenex_22_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && (\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]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\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)) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_v_prenex_22_4 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_22_4[63:63], v_skolemized_v_prenex_22_4[62:52], v_skolemized_v_prenex_22_4[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && hy == v_skolemized_v_prenex_22_4[63:32]) && ly == v_skolemized_v_prenex_22_4[31:0])) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) [2019-11-16 00:38:55,899 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_92e2a5d2-630c-47e8-8e0e-b57919364c38/bin/uautomizer/witness.graphml [2019-11-16 00:38:55,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:38:55,900 INFO L168 Benchmark]: Toolchain (without parser) took 61336.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 952.3 MB in the beginning and 904.7 MB in the end (delta: 47.6 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,900 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:38:55,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,902 INFO L168 Benchmark]: Boogie Preprocessor took 107.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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,902 INFO L168 Benchmark]: RCFGBuilder took 37729.66 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: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,902 INFO L168 Benchmark]: TraceAbstraction took 22858.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.0 GB in the beginning and 919.3 MB in the end (delta: 127.1 MB). Peak memory consumption was 188.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,903 INFO L168 Benchmark]: Witness Printer took 103.62 ms. Allocated memory is still 1.2 GB. Free memory was 919.3 MB in the beginning and 904.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:55,905 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 37729.66 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: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22858.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.0 GB in the beginning and 919.3 MB in the end (delta: 127.1 MB). Peak memory consumption was 188.9 MB. Max. memory is 11.5 GB. * Witness Printer took 103.62 ms. Allocated memory is still 1.2 GB. Free memory was 919.3 MB in the beginning and 904.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 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 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 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 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 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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,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 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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 257]: 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-16 00:38:55,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - 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: 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-16 00:38:55,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,925 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]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\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)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 142]: Loop Invariant [2019-11-16 00:38:55,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,931 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-16 00:38:55,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-16 00:38:55,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-16 00:38:55,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-16 00:38:55,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:38:55,937 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_5 : bv64, v_skolemized_q#valueAsBitvector_34 : bv64 :: (~bvor32(~bvand32(1bv32, ~bvashr32(v_skolemized_v_prenex_22_5[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_34[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_5[63:63], v_skolemized_v_prenex_22_5[62:52], v_skolemized_v_prenex_22_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && (\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]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\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)) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_v_prenex_22_4 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_22_4[63:63], v_skolemized_v_prenex_22_4[62:52], v_skolemized_v_prenex_22_4[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && hy == v_skolemized_v_prenex_22_4[63:32]) && ly == v_skolemized_v_prenex_22_4[31:0])) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. Result: SAFE, OverallTime: 22.7s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 560 SDtfs, 1873 SDslu, 656 SDs, 0 SdLazy, 227 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred 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, 210 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 218 ConstructedInterpolants, 71 QuantifiedInterpolants, 50048 SizeOfPredicates, 58 NumberOfNonLiveVariables, 931 ConjunctsInSsa, 74 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...